Abstract
It is proved that, if the DFP or BFGS algorithm with step-lengths of one is applied to a functionF(x) that has a Lipschitz continuous second derivative, and if the calculated vectors of variables converge to a point at which ∇F is zero and ∇2 F is positive definite, then the sequence of variable metric matrices also converges. The limit of this sequence is identified in the case whenF(x) is a strictly convex quadratic function.
Similar content being viewed by others
References
C.G. Broyden, “The convergence of a class of double-rank minimisation algorithms. I. General considerations”,Journal of the Institute of Mathematics and Its Applications 6 (1970) 76–90.
C.G. Broyden, J.E. Dennis and J.J. Moré, “On the local and superlinear convergence of quasi-Newton methods”,Journal of the Institute of Mathematics and Its Applications 12 (1973) 223–245.
J.E. Dennis and J.J. Moré, “Quasi-Newton methods, motivation and theory”,SIAM Review 19 (1977) 46–89.
R. Fletcher, “A new approach to variable metric algorithms”,Computer Journal 13 (1970) 317–322.
R. Fletcher,Unconstrained optimization, Practical methods of optimization, Vol. 1, (Wiley, Chichester, 1980).
M.J.D. Powell, “On the convergence of the variable metric algorithm”,Journal of the Institute of Mathematics and Its Applications 7 (1971) 21–36.
M.J.D. Powell, “Quadratic termination properties of minimization algorithms I. Statement and discussion of results”,Journal of the Institute of Mathematics and Its Applications 10 (1972) 333–342.
M.J.D. Powell, “Some global convergence properties of a variable metric algorithm for minimization without exact line searches”, in: R.W. Cottle and C.E. Lemke, eds.Nonlinear programming, SIAM-AMS Proceedings IX (1976) 53–72.
M.J.D. Powell, “The convergence of variable metric methods for nonlinearly constrained optimization calculations”, in: O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.,Nonlinear programming 3 (Academic Press, New York, 1978) pp. 27–63.
J.H. Wilkinson,The algebraic eigenvalue problem (Oxford University Press, Oxford, 1965).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ren-pu, G., Powell, M.J.D. The convergence of variable metric matrices in unconstrained optimization. Mathematical Programming 27, 123–143 (1983). https://doi.org/10.1007/BF02591941
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02591941