Global convergence properties of conjugate gradient methods for optimization
Résumé
We study the convergence of nonlinear conjugate gradient methods without restarts and with practical line searches. The analysis covers two classes of methods that are globally convergent on smooth, non convex functions. Some properties of the Fletcher-Reeves method play an important role in the first family, whereas the second family shares an important property with the Polak-Ribiere method. Numerical experiments are presented.
