Efficient generalized conjugate gradient algorithms. I: Theory (Q915657)
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: Publication:915657 |
scientific article; zbMATH DE number 4152166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient generalized conjugate gradient algorithms. I: Theory |
scientific article; zbMATH DE number 4152166 |
Statements
Efficient generalized conjugate gradient algorithms. I: Theory (English)
0 references
1991
0 references
The effect of inexact line search on conjugacy is studied in unconstrained optimization. A generalized conjugate gradient method based on this effect is proposed and shown to have global convergence for a twice continuously differentiable function with a bounded level set. For part II see [\textit{Y. F. Hu} and second author, J. Optim. Theory Appl. 69, No. 1, 139--152 (1991; Zbl 0724.90068)].
0 references
inexact line search
0 references
conjugacy
0 references
unconstrained optimization
0 references
generalized conjugate gradient method
0 references
global convergence
0 references
0 references
0.9011263251304626
0 references
0.8669653534889221
0 references
0.8390650153160095
0 references
