Limited-memory BFGS systems with diagonal updates (Q417600)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Limited-memory BFGS systems with diagonal updates |
scientific article; zbMATH DE number 6034534
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limited-memory BFGS systems with diagonal updates |
scientific article; zbMATH DE number 6034534 |
Statements
Limited-memory BFGS systems with diagonal updates (English)
0 references
14 May 2012
0 references
quasi-Newton methods
0 references
limited-memory methods
0 references
inverses
0 references
Sherman-Morrison-Woodbury
0 references
diagonal updates
0 references
large-scale optimization
0 references
trust-region methods
0 references
doubly-augmented Lagrangian method
0 references
numerical experiments
0 references
Broyden-Fletcher-Goldfarb-Shanno (BFGS)
0 references
0 references
0 references
The authors develop a recursion formula for solving systems of the following form: \((B+\sigma I)x= y\), where \(B\) is a limited-memory Broyden-Fletcher-Goldforb-Shanno (BFGS) quasi-Newton matrix and \(\sigma\) is a positive constant.NEWLINENEWLINE These types of systems arise in large-scale optimization such as trust-region methods as well as doubly-augmented Lagrangian method. Numerical experiments are given.
0 references
0.835151195526123
0 references
0.8260700106620789
0 references
0.8125767111778259
0 references
0.7915858626365662
0 references
0.7908678650856018
0 references
