A sequential quadratic programming algorithm for nonlinear minimax problems
From MaRDI portal
Publication:5301244
DOI10.1017/S0004972700039745zbMath1146.90088MaRDI QIDQ5301244
Publication date: 29 April 2008
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Minimax problems in mathematical programming (90C47) Numerical optimization and variational techniques (65K10) Methods of successive quadratic programming type (90C55)
Cites Work
- 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
- Smooth Optimization Methods for Minimax Problems
- Variable metric methods for minimizing a class of nondifferentiable functions
- A surperlinearly convergent algorithm for constrained optimization problems
