Keywords
Broyden–Fletcher–Goldfarb–Shanno algorithmQuasi-Newton methodConvergence (economics)Mathematical optimizationMathematicsScale (ratio)Computer scienceApplied mathematicsNewton's methodNonlinear system
Affiliated Institutions
Related Publications
Updating quasi-Newton matrices with limited storage
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 mat...
A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
Based upon analysis and numerical experience, the BFGS (Broyden–Fletcher–Goldfarb–Shanno) algorithm is currently considered to be one of the most effective algorithms for findin...
Preconditioning of Truncated-Newton Methods
In this paper we discuss the use of truncated-Newton methods, a flexible class of iterative methods, in the solution of large-scale unconstrained minimization problems. At each ...
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Preface 1. Introduction. Problems to be considered Characteristics of 'real-world' problems Finite-precision arithmetic and measurement of error Exercises 2. Nonlinear Problems ...
Conjugate Gradient Methods with Inexact Searches
Conjugate gradient methods are iterative methods for finding the minimizer of a scalar function f(x) of a vector variable x which do not update an approximation to the inverse H...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 45
- Issue
- 1-3
- Pages
- 503-528
- Citations
- 8077
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
8077
OpenAlex
Cite This
Cheng‐Di Dong,
Jorge Nocedal
(1989).
On the limited memory BFGS method for large scale optimization.
Mathematical Programming
, 45
(1-3)
, 503-528.
https://doi.org/10.1007/bf01589116
Identifiers
- DOI
- 10.1007/bf01589116