A global convergence of LS-CD hybrid conjugate gradient method (Q2248683)
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 global convergence of LS-CD hybrid conjugate gradient method |
scientific article; zbMATH DE number 6309189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A global convergence of LS-CD hybrid conjugate gradient method |
scientific article; zbMATH DE number 6309189 |
Statements
A global convergence of LS-CD hybrid conjugate gradient method (English)
0 references
27 June 2014
0 references
Summary: The conjugate gradient method is one of the most effective algorithms for solving unconstrained optimization problem. In this paper, a modified conjugate gradient method is presented and analyzed which is a hybridization of known least squares (LS) and conjugate direction (CD) conjugate gradient algorithms. Under some mild conditions, the Wolfe-type line search can guarantee the global convergence of the LS-CD method. The numerical results show that the algorithm is efficient.
0 references
conjugate gradient method
0 references
algorithm
0 references
unconstrained optimization problem
0 references
least squares
0 references
conjugate direction
0 references
Wolfe-type line search
0 references
global convergence
0 references
numerical results
0 references
0 references
0 references
0.9108846783638
0 references
0.8992821574211121
0 references
0.8984998464584351
0 references
0.898097813129425
0 references
0.8969008326530457
0 references
