A general class of penalty/barrier path-following Newton methods for nonlinear programming

DOI10.1080/02331930412331326310zbMath1104.90046MaRDI QIDQ4675963

M. Zadlo, Christian Grossmann

Publication date: 6 May 2005

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930412331326310

zbMATH Keywords

Newton method; interior point methods; path-following; penalty/barrier approach

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

49M15: Newton-type methods

Related Items

Newton-KKT interior-point methods for indefinite quadratic programming, Smoothing Newton method for operator equations in Banach spaces, Mesh-independent convergence of penalty methods applied to optimal control with partial differential equations, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, Elliptic Control by Penalty Techniques with Control Reduction, Penalized interior point approach for constrained nonlinear programming

Cites Work

• Unnamed Item
• Unnamed Item
• More test examples for nonlinear programming codes
• Solution of variational inequalities in mechanics
• Stable exponential-penalty algorithm with superlinear convergence
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
• Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems
• Path-following barrier and penalty methods for linearly constrained problems
• Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
• Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
• A Noninterior Continuation Method for Quadratic and Linear Programming
• On the Convergence of a Sequential Penalty Function Method for Constrained Minimization
• Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
• Asymptotic analysis of a path-following barrier method for linearly constrained convex problems^*
• Numerical Stability and Efficiency of Penalty Algorithms
• Quadratic rate of convergence for a primal-dual exponential penalty algorithm
• A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
• Why a Pure Primal Newton Barrier Step May be Infeasible
• Interior Methods for Nonlinear Optimization
• Penalty and Barrier Methods: A Unified Framework
• Complexity of a noninterior path-following method for the linear complementarity problem