Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

A three-parameter family of nonlinear conjugate gradient methods


Authors: Y. H. Dai and Y. Yuan
Journal: Math. Comp. 70 (2001), 1155-1167
MSC (2000): Primary 49M37, 65K05, 90C30
Published electronically: March 28, 2000
MathSciNet review: 1826579
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract:

In this paper, we propose a three-parameter family of conjugate gradient methods for unconstrained optimization. The three-parameter family of methods not only includes the already existing six practical nonlinear conjugate gradient methods, but subsumes some other families of nonlinear conjugate gradient methods as its subfamilies. With Powell's restart criterion, the three-parameter family of methods with the strong Wolfe line search is shown to ensure the descent property of each search direction. Some general convergence results are also established for the three-parameter family of methods. This paper can also be regarded as a brief review on nonlinear conjugate gradient methods.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 49M37, 65K05, 90C30

Retrieve articles in all journals with MSC (2000): 49M37, 65K05, 90C30


Additional Information

Y. H. Dai
Affiliation: State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, P. O. Box 2719, Beijing 100080, China
Email: dyh@lsec.cc.ac.cn

Y. Yuan
Affiliation: State Key Laboratory of Scientific and Engineering Computing, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, P. O. Box 2719, Beijing 100080, China
Email: yyx@lsec.cc.ac.cn

DOI: http://dx.doi.org/10.1090/S0025-5718-00-01253-9
PII: S 0025-5718(00)01253-9
Keywords: Unconstrained optimization, conjugate gradient methods, line search, global convergence.
Received by editor(s): January 22, 1999
Received by editor(s) in revised form: September 7, 1999
Published electronically: March 28, 2000
Additional Notes: Research partly supported by Chinese NSF grants 19525101, 19731010 and 19801033.
Article copyright: © Copyright 2000 American Mathematical Society