Nonconvex minimization calculations and the conjugate gradient method
We consider the global convergence of conjugate gradient methods without restarts, assuming exact arithmetic and exact line searches, when the objective function is twice continuously differentiable and has bounded level sets. Most of our attention is given to the Polak-Ribière algorithm, and unfortunately we find examples that show that the calculated gradients can remain bounded away from zero. The examples that have only two variables show also that some variable metric algorithms for unconstrained optimization need not converge. However, a global convergence theorem is proved for the Fletcher-Reeves version of the conjugate gradient method.
Unable to display preview. Download preview PDF.
- A. Buckley (1982), "Conjugate gradient methods", in Nonlinear Optimization 1981, ed. M.J.D. Powell, Academic Press (London).Google Scholar
- G. Zoutendijk (1970), "Nonlinear programming, computational methods", in Integer and Nonlinear Programming, ed. J. Abadie, North-Holland Publishing Co. (Amsterdam).Google Scholar