Pages that link to "Item:Q556270"
From MaRDI portal
The following pages link to A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270):
Displayed 6 items.
- An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← 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)
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
- Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)