A new three-term conjugate gradient method (Q761255): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00941495 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090988481 / rank | |||
Normal rank | |||
Latest revision as of 08:46, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new three-term conjugate gradient method |
scientific article |
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
