A new superlinearly convergent SQP algorithm for nonlinear minimax problems
From MaRDI portal
Recommendations
- A modified SQP algorithm for minimax problems
- A superlinearly convergent sequential quadratic programming algorithm for minimax problems
- Nonmonotone line search algorithm for constrained minimax problems
- A sequential quadratic programming algorithm for nonlinear minimax problems
- A new non-monotone SQP algorithm for the minimax problem
Cites work
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- scientific article; zbMATH DE number 1932369 (Why is no real title available?)
- New minimax algorithm
- Nonmonotone line search algorithm for constrained minimax problems
- Nonmonotone line search for minimax problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Superlinearly convergent algorithm for min-max problems
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(24)- An improved SQP algorithm for solving minimax problems
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Corrected sequential linear programming for sparse minimax optimization
- A QP-free algorithm for finite minimax problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- A hybrid algorithm for nonlinear minimax problems
- Improved filter-SQP algorithm with active set for constrained minimax problems
- A nonmonotonic hybrid algorithm for min-max problem
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- A hybrid algorithm for linearly constrained minimax problems
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem
- scientific article; zbMATH DE number 7338817 (Why is no real title available?)
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- A new non-monotone SQP algorithm for the minimax problem
- A new QP-free algorithm for nonlinear minimax problems
- A norm-relaxed SQP algorithm with a system of linear equations for constrained minimax problems
- A sequential quadratic programming algorithm for nonlinear minimax problems
- A superlinearly convergent sequential quadratic programming algorithm for minimax problems
- Parameter estimation in models generated by SDEs with symmetric alpha-stable noise
- Nonmonotone algorithm for minimax optimization problems
- A modified SQP algorithm for minimax problems
This page was built for publication: A new superlinearly convergent SQP algorithm for nonlinear minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468786)
