Pages that link to "Item:Q1810966"
From MaRDI portal
The following pages link to A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent (Q1810966):
Displayed 14 items.
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
- Sequential feasible optimal power flow in power systems (Q1045287) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
- Improving ultimate convergence of an augmented Lagrangian method (Q3539788) (← links)
- Penalized interior point approach for constrained nonlinear programming (Q3572651) (← links)
- An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)
- On second-order optimality conditions for nonlinear programming (Q5426957) (← links)