JavaScript is disabled for your browser. Some features of this site may not work without it.
On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem

Author
Coleman, Thomas F.; Conn, Andrew R.
Abstract
In this paper we propose a new local quasi-Newton method to solve the equality constrained non-linear programming problem. The pivotal feature of the algorithm is that a projection of the Hessian of the Lagrangian is approximated by a sequence of symmetric positive definitive matrices. The matrix approximation is updated at every iteration by a projected version of the DFP or BFGS formula. We establish that the method is locally convergent and the sequence of x-values converges to the solution at a 2-step Q-superlinear rate.
Date Issued
1982-08Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-509
Type
technical report