Globally convergent conjugate gradient algorithms (Q3703663)
From MaRDI portal
!
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 3928733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Globally convergent conjugate gradient algorithms |
scientific article; zbMATH DE number 3928733 |
Statements
Globally convergent conjugate gradient algorithms (English)
0 references
1985
0 references
convergence
0 references
conjugate gradient algorithms
0 references
unconstrained minimization
0 references
steepest descent search direction
0 references
0.8746674656867981
0 references
The paper deals with the convergence of the conjugate gradient algorithms for unconstrained minimization. A test is proposed, determining when to restart the conjugate gradient methods by using the steepest descent search direction. The test examines the angle between the search direction and the negative gradient and guarantees convergence of the algorithm to a stationary point of the objective function when the latter is twice continuously differentiable and has a bounded level set.
0 references