Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
Authors: Coleman, Thomas F.
Conn, Andrew R.
Keywords: computer science
technical report
Issue Date: Aug-1982
Publisher: Cornell University
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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
82-509.pdf1.15 MBAdobe PDFView/Open
82-509.ps295.17 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us