Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
From MaRDI portal
Publication:2719236
DOI10.1137/S1052623400370515zbMath1003.65066OpenAlexW1982269962WikidataQ58185854 ScholiaQ58185854MaRDI QIDQ2719236
Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Phillipe L. Toint
Publication date: 21 June 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623400370515
primal-dual interior point methodinner iterationouter iterationnon-convex nonlinear programmingcomponentwise Q-superlinear convergence
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, A note on the use of vector barrier parameters for interior-point methods, Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, Local analysis of the feasible primal-dual interior-point method, A proximal interior point algorithm with applications to image processing, Filling holes under non-linear constraints, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, Structure-Exploiting Interior Point Methods, A local convergence property of primal-dual methods for nonlinear programming, Penalized interior point approach for constrained nonlinear programming, On second-order optimality conditions for nonlinear programming, On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, Reduced order output feedback control design for PDE systems using proper orthogonal decomposition and nonlinear semidefinite programming, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, A general class of penalty/barrier path-following Newton methods for nonlinear programming, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming, A filter interior-point algorithm with projected Hessian updating for nonlinear optimization, Assessing the potential of interior point barrier filter line search methods: nonmonotoneversusmonotone approach, From global to local convergence of interior methods for nonlinear optimization
