Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Buckley (1982), "Conjugate gradient methods", in Nonlinear Optimization 1981, ed. M.J.D. Powell, Academic Press (London).
R. Fletcher (1980), Practical Methods of Optimization, Vol. I: Unconstrained Optimization, John Wiley & Sons (Chichester).
R. Fletcher and C.M. Reeves (1964), "Function minimization by conjugate gradients", The Computer Journal, Vol. 7, pp. 149–154.
M.J.D. Powell (1977), "Restart procedures for the conjugate gradient method", Math. Programming, Vol. 12, pp. 241–254.
J.R. Thompson (1977), "Examples of non-convergence of conjugate descent algorithms with exact line searches", Math. Programming, Vol. 12, pp. 356–360.
G. Zoutendijk (1970), "Nonlinear programming, computational methods", in Integer and Nonlinear Programming, ed. J. Abadie, North-Holland Publishing Co. (Amsterdam).
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Powell, M.J.D. (1984). Nonconvex minimization calculations and the conjugate gradient method. In: Griffiths, D.F. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 1066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099521
Download citation
DOI: https://doi.org/10.1007/BFb0099521
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13344-5
Online ISBN: 978-3-540-38881-4
eBook Packages: Springer Book Archive