On the accurate identification of active set for constrained minimax problems
From MaRDI portal
Publication:531696
DOI10.1016/j.na.2011.01.024zbMath1235.90150OpenAlexW2061558948MaRDI QIDQ531696
Jin-Bao Jian, Jie Li, Dao Lan 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
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)
Related Items
A nonmonotonic hybrid algorithm for min-max problem, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, Substitution secant/finite difference method to large sparse minimax problems, A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization, Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems, A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems, A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, New active set identification for general constrained optimization and minimax problems
Cites Work
- On the finite convergence of interior-point algorithms for linear programming
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Enlarging the region of convergence of Newton's method for constrained optimization
- Local convergence of interior-point algorithms for degenerate monotone LCP
- Identification of the optimal active set in a noninterior continuation method for LCP
- On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm
- Nonmonotone line search algorithm for constrained minimax problems
- A new penalty method for nonlinear programming
- Hybrid approach with active set identification for mathematical programs with complementarity constraints
- Active Set Identification in Nonlinear Programming
- On the Identification of Active Constraints
- On the Accurate Identification of Active Constraints
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
