On the accurate identification of active set for constrained minimax problems
DOI10.1016/J.NA.2011.01.024zbMATH Open1235.90150OpenAlexW2061558948MaRDI QIDQ531696FDOQ531696
Authors: Jinbao Jian, Jie Li, Daolan Han 
Publication date: 19 April 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2011.01.024
Recommendations
- New active set identification for general constrained optimization and minimax problems
- On the Accurate Identification of Active Constraints
- Active Set Identification in Nonlinear Programming
- scientific article; zbMATH DE number 6270281
- On the Identification of Active Constraints II: The Nonconvex Case
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Active Set Identification in Nonlinear Programming
- On the Accurate Identification of Active Constraints
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- On the finite convergence of interior-point algorithms for linear programming
- On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
- On the Identification of Active Constraints
- A new penalty method for nonlinear programming
- Enlarging the region of convergence of Newton's method for constrained optimization
- Nonmonotone line search algorithm for constrained minimax problems
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Identification of the optimal active set in a noninterior continuation method for LCP
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
Cited In (16)
- New concepts of active constraints and applications: a review
- Active-set Methods for Submodular Minimization Problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- On the use of outer approximations as an external active set strategy
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
- Title not available (Why is that?)
- A nonmonotonic hybrid algorithm for min-max problem
- New active set identification for general constrained optimization and minimax problems
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- Active set identification for linearly constrained minimization without explicit derivatives
- Active Set Identification in Nonlinear Programming
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- Substitution secant/finite difference method to large sparse minimax problems
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- Identifying activity
This page was built for publication: On the accurate identification of active set for constrained minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q531696)
