A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
Recently, conjugate gradient methods, which usually generate descent search directions, are useful for large-scale optimization. Narushima et al. (SIAM J Optim 21:212–230, 2011 ) have proposed a three-term conjugate gradient method which satisfies a sufficient descent condition. We extend this metho...
Gespeichert in:
Veröffentlicht in: | Computational optimization and applications 2015-01, Vol.60 (1), p.89-110 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Recently, conjugate gradient methods, which usually generate descent search directions, are useful for large-scale optimization. Narushima et al. (SIAM J Optim 21:212–230,
2011
) have proposed a three-term conjugate gradient method which satisfies a sufficient descent condition. We extend this method to two parameters family of three-term conjugate gradient methods which can be used to control the magnitude of the directional derivative. We show that these methods converge globally and work well for suitable choices of the parameters. Numerical results are also presented. |
---|---|
ISSN: | 0926-6003 1573-2894 |
DOI: | 10.1007/s10589-014-9662-z |