A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
From MaRDI portal
Publication:1810966
DOI10.1023/A:1022944802542zbMath1038.90098OpenAlexW1533744522MaRDI QIDQ1810966
André L. Tits, Sasan Bakhtiari
Publication date: 9 June 2003
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022944802542
constrained optimizationnonlinear programmingfeasibilityprimal-dual interior-point methodsmonotone descent
Related Items (14)
Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ Newton-KKT interior-point methods for indefinite quadratic programming ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ Improving ultimate convergence of an augmented Lagrangian method ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ Penalized interior point approach for constrained nonlinear programming ⋮ On second-order optimality conditions for nonlinear programming ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties ⋮ A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ Sequential feasible optimal power flow in power systems
Uses Software
This page was built for publication: A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
