Pages that link to "Item:Q2468786"
From MaRDI portal
The following pages link to A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786):
Displaying 12 items.
- A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
- A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
- Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
- Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
- A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
