Pages that link to "Item:Q2572703"
From MaRDI portal
The following pages link to A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703):
Displaying 4 items.
- A globally and superlinearly convergent modified SQP-filter method (Q933797) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)
