Pages that link to "Item:Q5485718"
From MaRDI portal
The following pages link to Generalised monotone line search algorithm for degenerate nonlinear minimax problems (Q5485718):
Displaying 8 items.
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
- Nonmonotone line search for minimax problems (Q1321311) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
- Cost approximation algorithms with nonmonotone line searches for a general class of nonlinear programs (Q4944413) (← links)