A modified SQP algorithm for minimax problems
From MaRDI portal
Publication:837129
DOI10.1016/j.jmaa.2009.06.009zbMath1178.90345OpenAlexW1981981610MaRDI QIDQ837129
Nei-Ping Chen, Yu Chen, Xue-Quan Li, Qing-Jie Hu
Publication date: 10 September 2009
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2009.06.009
Minimax problems in mathematical programming (90C47) Methods of successive quadratic programming type (90C55)
Related Items
A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints, A QP-free algorithm for finite minimax problems, Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems, Improved filter-SQP algorithm with active set for constrained minimax problems
Cites Work
- Unnamed Item
- A compact variable metric algorithm for nonlinear minimax approximation
- Computer-aided design via optimization: A review
- A globally convergent method for nonlinear programming
- New minimax algorithm
- Nonmonotone line search for minimax problems
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- Nonmonotone line search algorithm for constrained minimax problems
- Exact penalty function algorithm with simple updating of the penalty parameter
- Superlinearly convergent algorithm for min-max problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- Smooth Optimization Methods for Minimax Problems
- Variable metric methods for minimizing a class of nondifferentiable functions
- A note on quasi-newton formulae for sparse second derivative matrices
- A surperlinearly convergent algorithm for constrained optimization problems
- On the Accurate Identification of Active Constraints
