Relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms
Journal Article
·
· SIAM J. Numer. Anal.; (United States)
On the basis of analysis and numerical experience, the BFGS (Broyden-Fletcher-Goldfarb-Shanno) algorithm is currently considered to be one of the most effective algorithms for finding a minimum of an unconstrained function, f(x), x an element of R/sup n/. However, when computer storage is at a premium, the usual alternative is to use a conjugate gradient (CG) method. It is shown here that the two algorithms are related to one another in a particularly close way. Based upon these observations, a new family of algorithms is proposed. 2 tables.
- Research Organization:
- Argonne National Lab., IL
- OSTI ID:
- 5401317
- Journal Information:
- SIAM J. Numer. Anal.; (United States), Journal Name: SIAM J. Numer. Anal.; (United States) Vol. 16:5; ISSN SJNAA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Relationship between the BFGS and conjugate gradient algorithms
A STRUCTURED QUASI-NEWTON ALGORITHM FOR OPTIMIZING WITH INCOMPLETE HESSIAN INFORMATION
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
Technical Report
·
Fri Dec 31 23:00:00 EST 1976
·
OSTI ID:7220579
A STRUCTURED QUASI-NEWTON ALGORITHM FOR OPTIMIZING WITH INCOMPLETE HESSIAN INFORMATION
Journal Article
·
Mon Dec 31 23:00:00 EST 2018
· SIAM Journal on Optimization
·
OSTI ID:1573037
A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information
Journal Article
·
Wed Apr 10 20:00:00 EDT 2019
· SIAM Journal on Optimization
·
OSTI ID:1574637