This paper studies the convergence properties of nonlinear conjugate gradient methods without restarts, and with practical line searches for the problem . Iterations of the search directions and new points under study are chosen as:
Various choices of and inexact line searches that result in global convergence are considered. The analysis is closely related to the methods of Fletcher-Reeves and Polak-Ribière. Numerical experiments are presented.