Abstract.
This paper explores the convergence of nonlinear conjugate gradient methods with Goldstein line search without regular restarts. Under this line search, global convergence for a subsequence is given for the famous conjugate gradient methods, Fletcher-Reeves method. The same result can be obtained for Polak-Ribiére-Polyak method and others.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
*This work was partially supported by National Hitech Program (863,2002AA104540) and National Natural Science Foundation of China (No.60373060).
About this article
Cite this article
Wang, J., Chi, X. CG Global Convergence Properties with Goldstein Linesearch*. Bull Braz Math Soc, New Series 36, 197–204 (2005). https://doi.org/10.1007/s00574-005-0036-0
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00574-005-0036-0
Keywords:
- unconstrained optimization
- conjugate gradient method
- Goldstein conditions
- line search
- global convergence