Cornell University
Library
Cornell UniversityLibrary

eCommons

Help
Log In(current)
  1. Home
  2. Cornell Computing and Information Science
  3. Computer Science
  4. Computer Science Technical Reports
  5. Local Convergence Theorems for Quasi-Newton Methods

Local Convergence Theorems for Quasi-Newton Methods

File(s)
79-383.pdf (768.82 KB)
79-383.ps (363.76 KB)
Permanent Link(s)
https://hdl.handle.net/1813/7498
Collections
Computer Science Technical Reports
Author
Dennis, John E. Jr.
Walker, Homer F.
Abstract

This paper presents generalizations of the two results which have been useful for analyzing methods of the form $x_{k+1} = x_{k} - B_{k}^{-1}F(x_{k})$. The bounded deterioration theorem of Broyden-Dennis-More is generalized to show that if {$B_{k}$} or {$B_{k}^{-1}$} is of bounded deterioration as a sequence of approximants to some $B_{}$ or $B_{}^{-1}$ then the iteration above has the same local convergence properties and arbitrarily nearly the same linear rate as would be achieved by the stationary iteration function which uses $B_{k} = B_{}$. The characterization theorem for superlinear convergence given by Dennis-More is then generalized to give conditions under which the rates are the same. In the case when $B_{} = F'(x_{*})$, these results reduce to those already known.

Date Issued
1979-07
Publisher
Cornell University
Keywords
computer science
•
technical report
Previously Published as
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR79-383
Type
technical report

Site Statistics | Help

About eCommons | Policies | Terms of use | Contact Us

copyright © 2002-2026 Cornell University Library | Privacy | Web Accessibility Assistance