Pages that link to "Item:Q481052"
From MaRDI portal
The following pages link to Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052):
Displayed 6 items.
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- A globally convergent QP-free algorithm for inequality constrained minimax optimization (Q2151966) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
- A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)