eCommons

 

A Characterization of Superlinear Convergence and its Application to Quasi-Newton Methods

Other Titles

Abstract

Let F be a mapping from real n-dimensional Euclidean space into itself. Most practical algorithms for finding a zero of F are of the form xk+1=xkBk−1Fxk where {Bk} is a sequence of non-singular matrices. The main result of this paper is a characterization theorem for the superlinear convergence to a zero of F of sequences of the above form. This result is then used to give a unified treatment of the results on the superlinear convergence of the Davidon-Fletcher-Powell method obtained by Powell for the case in which exact line searches are used, and by Broyden, Dennis, and More for the case without line searches. As a by-product, several results on the asymptotic behavior of the sequence {Bk} are obtained. An interesting aspect of these results is that superlinear convergence is obtained without any consistency conditions; i.e. without requiring that the sequence {Bk} converge to the Jacobian.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1973-01

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR73-157

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record