A superlinearly convergent sequential quadratic programming algorithm for minimax problems
From MaRDI portal
Publication:5490746
Recommendations
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- scientific article; zbMATH DE number 1932369
- An improved SQP algorithm for solving minimax problems
- A modified SQP algorithm for minimax problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
Cited in
(16)- A modified super convergent line series algorithm for solving quadratic programming problems
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- On solving large-scale finite minimax problems using exponential smoothing
- scientific article; zbMATH DE number 1932369 (Why is no real title available?)
- scientific article; zbMATH DE number 3978827 (Why is no real title available?)
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems
- scientific article; zbMATH DE number 4152164 (Why is no real title available?)
- Improved filter-SQP algorithm with active set for constrained minimax problems
- scientific article; zbMATH DE number 7009452 (Why is no real title available?)
- A new non-monotone SQP algorithm for the minimax problem
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- An improved SQP algorithm for solving minimax problems
- A \(J\)-symmetric quasi-Newton method for minimax problems
- A modifed feasible SQP method for constrained minimax optimization problems
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- A modified SQP algorithm for minimax problems
This page was built for publication: A superlinearly convergent sequential quadratic programming algorithm for minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5490746)
