Generalised monotone line search algorithm for degenerate nonlinear minimax problems
From MaRDI portal
Publication:5485718
Recommendations
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- A sequential quadratic programming algorithm for nonlinear minimax problems
- Nonmonotone algorithm for minimax optimization problems
- Nonmonotone line search for minimax problems
Cites work
- scientific article; zbMATH DE number 3727523 (Why is no real title available?)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity
- New minimax algorithm
- Nonmonotone line search for minimax problems
- On combining feasibility, descent and superlinear convergence in inequality constrained optimization
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(9)- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- A QP-free algorithm for finite minimax problems
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Nonmonotone line search for minimax problems
- A nonmonotone line search based algorithm for distribution center location selected
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems
- Generalized monotone line search SQP algorithm for constrained minimax problems
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs
This page was built for publication: Generalised monotone line search algorithm for degenerate nonlinear minimax problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485718)
