Asymptotic analysis of a path-following barrier method for linearly constrained convex problems*
Author:
- 1 January 1999
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 45 (1-4) , 69-87
Abstract
In the present paper the logarithmic barrier method applied to the linearly constrained convex optimization problems is studied from the view point of classical path-following algorithms. In particular, the radius of convergence of Newton's method which depends on the barrier parameter itself is estimated in standard norms, being independent of the parameter, without explicitly using self-concordance properties. The obtained results establish a parameter selection rule which guarantees the overall convergence of a barrier technique with only one Newton step at each parameter level and the complexity of the method can be estimated.Keywords
This publication has 6 references indexed in Scilit:
- Interior Point Approach to Linear, Quadratic and Convex Programming1994
- Area of contraction of Newton's method applied to a penalty technique for obstacle problemsApplications of Mathematics, 1993
- Numerik der Optimierung1993
- Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii TheoremSIAM Journal on Numerical Analysis, 1992
- Global inexact Newton methods for very large scale nonlinear problemsIMPACT of Computing in Science and Engineering, 1991
- On some efficient interior point methods for nonlinear convex programmingLinear Algebra and its Applications, 1991