Optimization Online


On the Convergence of Newton Iterations to Non-Stationary Points

Richard Byrd (richard***at***cs.colorado.edu)
Marcelo Marazzi (marazzi***at***ece.nwu.edu)
Jorge Nocedal (nocedal***at***ece.nwu.edu)

Abstract: We study conditions under which line search Newton methods for nonlinear systems of equations and optimization fail due to the presence of singular non-stationary points. These points are not solutions of the problem and are characterized by the fact that Jacobian or Hessian matrices are singular. It is shown that, for systems of nonlinear equations, the interaction between the Newton direction and the merit function can prevent the iterates from escaping such non-stationary points. The unconstrained minimization problem is also studied, and conditions under which false convergence cannot occur are presented. Several examples illustrating failure of Newton iterations for constrained optimization are also presented. The paper concludes by showing that a class of line search feasible interior methods cannot exhibit convergence to non-stationary points.

Keywords: Newton's method, interior point methods, global convergence, unconstrained optimization, nonlinear systems of equations

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Unconstrained Optimization )

Category 3: Nonlinear Optimization (Nonlinear Systems and Least-Squares )

Citation: Report OTC 2001/7 Optimization Technology Center, Northwestern University April, 2001

Download: [Compressed Postscript][PDF]

Entry Submitted: 04/24/2001
Entry Accepted: 04/24/2001
Entry Last Modified: 04/24/2001

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