Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Updating quasi-Newton matrices with limited storage


Author: Jorge Nocedal
Journal: Math. Comp. 35 (1980), 773-782
MSC: Primary 65K05; Secondary 90C30
DOI: https://doi.org/10.1090/S0025-5718-1980-0572855-7
MathSciNet review: 572855
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We study how to use the BFGS quasi-Newton matrices to precondition minimization methods for problems where the storage is critical. We give an update formula which generates matrices using information from the last m iterations, where m is any number supplied by the user. The quasi-Newton matrix is updated at every iteration by dropping the oldest information and replacing it by the newest information. It is shown that the matrices generated have some desirable properties.

The resulting algorithms are tested numerically and compared with several well-known methods.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65K05, 90C30

Retrieve articles in all journals with MSC: 65K05, 90C30


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1980-0572855-7
Article copyright: © Copyright 1980 American Mathematical Society