Efficient generalized conjugate gradient algorithms. II: Implementation (Q2277157)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 4195726
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient generalized conjugate gradient algorithms. II: Implementation |
scientific article; zbMATH DE number 4195726 |
Statements
Efficient generalized conjugate gradient algorithms. II: Implementation (English)
0 references
1991
0 references
In part I of this paper [see the previous preview by\textit{Y. Liu} and the second author [J. Optim. Theory Appl. 69, No. 1, 129--137 (1991; Zbl 0702.90077)] a new, generalized conjugate gradient algorithm was proposed and its convergence investigated. In this second part, the new algorithm is compared numerically with other modified conjugate gradient methods and with limited memory quasi-Newton methods.
0 references
unconstrained optimization
0 references
hybrid and restart conjugate gradient methods
0 references
inexact line search
0 references
comparison of algorithms
0 references
limited memory quasi-Newton methods
0 references
0.9640875
0 references
0.92151767
0 references
0 references
0.9001062
0 references
