Path-following barrier and penalty methods for linearly constrained problems

DOI10.1080/02331930008844510zbMath0980.90084OpenAlexW2005020657MaRDI QIDQ2709451

Tuan, V. K., Dhaifalla K. Al-Mutairi, Christian Grossmann

Publication date: 27 November 2001

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Newton's methodSUMTinterior point methodspenalty methodsbarrier methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical computation of solutions to systems of equations (65H10) Interior-point methods (90C51)

Related Items

Path-following barrier and penalty methods for linearly constrained problems, General primal-dual penalty/barrier path-following Newton methods for nonlinear programming, A general class of penalty/barrier path-following Newton methods for nonlinear programming

Cites Work

• Unnamed Item
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• On some efficient interior point methods for nonlinear convex programming
• A continuation method for monotone variational inequalities
• A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems
• A sufficient condition for self-concordance, with application to some classes of structured convex programming problems
• Path-following barrier and penalty methods for linearly constrained problems
• Global inexact Newton methods for very large scale nonlinear problems
• Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii Theorem