A modified SQP algorithm for minimax problems
From MaRDI portal
Publication:837129
DOI10.1016/J.JMAA.2009.06.009zbMATH Open1178.90345OpenAlexW1981981610MaRDI QIDQ837129FDOQ837129
Authors: Qingjie Hu, Yu Chen, Neiping Chen, Xue-Quan Li 
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
Recommendations
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A sequential quadratic programming algorithm for nonlinear minimax problems
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- A superlinearly convergent sequential quadratic programming algorithm for minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
Methods of successive quadratic programming type (90C55) Minimax problems in mathematical programming (90C47)
Cites Work
- Smooth Optimization Methods for Minimax Problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A globally convergent method for nonlinear programming
- On the Accurate Identification of Active Constraints
- Exact penalty function algorithm with simple updating of the penalty parameter
- 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
- A surperlinearly convergent algorithm for constrained optimization problems
- Nonmonotone line search for minimax problems
- A compact variable metric algorithm for nonlinear minimax approximation
- New minimax algorithm
- Nonmonotone line search algorithm for constrained minimax problems
- Superlinearly convergent algorithm for min-max problems
- Variable metric methods for minimizing a class of nondifferentiable functions
- Title not available (Why is that?)
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- A note on quasi-newton formulae for sparse second derivative matrices
- A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
- Computer-aided design via optimization: A review
Cited In (15)
- A QP-free algorithm for finite minimax problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Nonmonotone line search algorithm for constrained minimax problems
- Improved filter-SQP algorithm with active set for constrained minimax problems
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- A new non-monotone SQP algorithm for the minimax problem
- A superlinearly convergent sequential quadratic programming algorithm for minimax problems
- A modifed feasible SQP method for constrained minimax optimization problems
- A sequential quadratic programming algorithm for nonlinear minimax problems
- A non-monotone SQP algorithm with L-BFGS update for solving semi-infinite minimax problem based on active set technique
- A norm-relaxed SQP algorithm with a system of linear equations for constrained minimax problems
- A unified study of necessary and sufficient optimality conditions for minimax and Chebyshev problems with cone constraints
- Title not available (Why is that?)
- An improved SQP algorithm for solving minimax problems
- Generalized monotone line search SQP algorithm for constrained minimax problems
This page was built for publication: A modified SQP algorithm for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q837129)
