Pages that link to "Item:Q1941312"
From MaRDI portal
The following pages link to An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312):
Displaying 10 items.
- A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
- Global and local convergence of a new affine scaling trust region algorithm for linearly constrained optimization (Q335312) (← links)
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization (Q2342895) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
- A kind of QP-free feasible method (Q2519715) (← links)
- A new QP-free algorithm for inequality constrained optimization without strict complementarity (Q2859832) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)