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 <italic>m</italic> iterations, where <italic>m</italic> 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.
Keywords
MathematicsMatrix (chemical analysis)Broyden–Fletcher–Goldfarb–Shanno algorithmMinificationAlgorithmNewton's methodApplied mathematicsCombinatoricsMathematical optimizationComputer scienceNonlinear system
Affiliated Institutions
Related Publications
Detection of conserved segments in proteins: iterative scanning of sequence databases with alignment blocks.
We describe an approach to analyzing protein sequence databases that, starting from a single uncharacterized sequence or group of related sequences, generates blocks of conserve...
ROBUST MODELING WITH ERRATIC DATA
An attractive alternative to least‐squares data modeling techniques is the use of absolute value error criteria. Unlike the least‐squares techniques the inclusion of some infini...
A spectral algorithm for envelope reduction of sparse matrices
Abstract The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope‐reducing reordering is...
Efficient MATLAB Computations with Sparse and Factored Tensors
In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. ...
Sparsity and incoherence in compressive sampling
We consider the problem of reconstructing a sparse signal x^0\\in{\\bb R}^n from a limited number of linear measurements. Given m randomly selected samples of Ux0, where U is an...
Publication Info
- Year
- 1980
- Type
- article
- Volume
- 35
- Issue
- 151
- Pages
- 773-782
- Citations
- 2631
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2631
OpenAlex
Cite This
Jorge Nocedal
(1980).
Updating quasi-Newton matrices with limited storage.
Mathematics of Computation
, 35
(151)
, 773-782.
https://doi.org/10.1090/s0025-5718-1980-0572855-7
Identifiers
- DOI
- 10.1090/s0025-5718-1980-0572855-7