A new three-term conjugate gradient method (Q761255)
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: A new three-term conjugate gradient method |
scientific article; zbMATH DE number 3887455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new three-term conjugate gradient method |
scientific article; zbMATH DE number 3887455 |
Statements
A new three-term conjugate gradient method (English)
0 references
1985
0 references
We describe an implementation and give performance results for a conjugate gradient algorithm for unconstrained optimization. The algorithm is based upon the Nazareth three-term formula and incorporates Allwright preconditioning matrices and restart tests. The performance results for this combination compare favorably with existing codes.
0 references
conjugate gradient algorithm
0 references
unconstrained optimization
0 references
Nazareth three- term formula
0 references
preconditioning matrices
0 references
restart tests
0 references
0.8643395900726318
0 references
0.8630684614181519
0 references
0.8574759364128113
0 references
0.8544662594795227
0 references