Optimization Online


Failure of Global Convergence for a Class of Interior Point Methods for Nonlinear Programming

Andreas Wächter (andreasw***at***andrew.cmu.edu)
Lorenz T. Biegler (lb01***at***andrew.cmu.edu)

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 do produce limit points that are neither feasible nor stationary points of some measure of the constraint violation, when applied to a well-posed problem.

Keywords: nonlinear optimization, interior point methods, global convergence, Newton's method

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization

Category 3: Nonlinear Optimization

Citation: Mathematical Programming 88(3), pp. 565-587, 2000


Entry Submitted: 08/18/2000
Entry Last Modified: 10/31/2000

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society