Global convergence of two spectral conjugate gradient methods
Two new nonlinear spectral conjugate gradient methods for solving unconstrained optimization problems are proposed. One is based on the Hestenes and Stiefel (HS) method and the spectral conjugate gradient method. The other is based on a mixed spectral HS-CD conjugate gradient method, which combines...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/50572/1/TahirAhmad2013_Globalconvergenceoftwospectral.pdf http://eprints.utm.my/id/eprint/50572/ http://dx.doi.org/10.2306/scienceasia1513-1874.2013.39.306 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Two new nonlinear spectral conjugate gradient methods for solving unconstrained optimization problems are proposed. One is based on the Hestenes and Stiefel (HS) method and the spectral conjugate gradient method. The other is based on a mixed spectral HS-CD conjugate gradient method, which combines the advantages of the spectral conjugate gradient method, the HS method, and the CD method. The directions generated by the methods are descent directions for the objective function. Under mild conditions, we prove that the spectral conjugate gradient methods with an Armijo-type line search are globally convergent. Numerical results show the proposed methods are promising |
|---|