Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
From MaRDI portal
Publication:2569198
DOI10.1007/s10957-005-2092-4zbMath1079.90159OpenAlexW1969207618MaRDI QIDQ2569198
Publication date: 18 October 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-005-2092-4
Related Items
On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods ⋮ An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization ⋮ Cubic regularization in symmetric rank-1 quasi-Newton methods ⋮ A modified SQP-filter method for nonlinear complementarity problem ⋮ Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
Cites Work
- Unnamed Item
- Unnamed Item
- An interior-point algorithm for nonconvex nonlinear programming
- On the convergence of Newton iterations to non-stationary points
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
- A Robust Algorithm for Optimization with General Equality and Inequality Constraints
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization
- A globally convergent primal-dual interior point method for constrained optimization
This page was built for publication: Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
