Pages that link to "Item:Q700746"
From MaRDI portal
The following pages link to Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746):
Displaying 10 items.
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
- Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- A feasible SQP method for nonlinear programming (Q2266975) (← links)
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
- An infeasible nonmonotone SSLE algorithm for nonlinear programming (Q2379186) (← links)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)
