Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
From MaRDI portal
Publication:4229467
DOI10.1137/S1052623496305560zbMath0915.90236MaRDI QIDQ4229467
Anders Forsgren, Philip E. Gill
Publication date: 22 February 1999
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
nonlinear programming; constrained minimization; penalty methods; primal-dual methods; barrier methods; modified Newton methods; interior methods
65K05: Numerical mathematical programming methods
90C06: Large-scale problems in mathematical programming
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
49M37: Numerical methods based on nonlinear programming
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
A general class of penalty/barrier path-following Newton methods for nonlinear programming, The interior-point revolution in optimization: History, recent developments, and lasting consequences, On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming, Primal-dual nonlinear rescaling method for convex optimization, Newton-KKT interior-point methods for indefinite quadratic programming, Reduced-basis techniques for rapid reliable optimization of systems described by affinely parametrized coercive elliptic partial differential equations, Examples of ill-behaved central paths in convex optimization, Inertia-controlling factorizations for optimization algorithms, Primal-dual Newton-type interior-point method for topology optimization, An interior method for nonconvex semidefinite programs, A truncated Newton method in an augmented Lagrangian framework for nonlinear programming, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, 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 primal-dual interior-point algorithm for nonlinear least squares constrained problems, Globally convergent interior-point algorithm for nonlinear programming, Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions, Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming
Uses Software
