Abstract.
Using a simple analytical example, we demonstrate that a class of interior point methods for general nonlinear programming, including some current methods, is not globally convergent. It is shown that those algorithms produce limit points that are neither feasible nor stationary points of some measure of the constraint violation, when applied to a well-posed problem.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 1999 / Accepted: May 2000¶Published online August 18, 2000
Rights and permissions
About this article
Cite this article
Wächter, A., Biegler, L. Failure of global convergence for a class of interior point methods for nonlinear programming. Math. Program. 88, 565–574 (2000). https://doi.org/10.1007/PL00011386
Issue Date:
DOI: https://doi.org/10.1007/PL00011386