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):
Displaying 13 items.
- An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
- A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- A Gauss-Newton approach for solving constrained optimization problems using differentiable exact penalties (Q1949585) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- A feasible SQP method for nonlinear programming (Q2266975) (← 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)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- A new superlinearly convergent SQP algorithm for nonlinear minimax problems (Q2468786) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← 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)
