On the order of convergence of preconditioned nonlinear conjugate gradient methods

An analysis is given of preconditioned nonlinear conjugate gradient methods in which the preconditioning matrix is the exact Hessian matrix at each iteration (or a nearby matrix). It is shown that the order of convergence of certain preconditioned methods is less than that of Newton's method when exact line searches are used, and an example is given.