Skip to main content
Log in

Numerical comparison of several variable-metric algorithms

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

The paper compares the numerical performances of the LDL′ decomposition of the BFGS variable-metric algorithm, the Dennis-Mei dogleg algorithm on the BFGS update, and Davidon's projections with the BFGS update with the straight BFGS update on a number of standard test problems. Numerical results indicate that the standard BFGS algorithm is superior to all of the more complex strategies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Broyden, C. G.,The Convergence of a Class of Double Rank Minimization Algorithms 2, the New Algorithm, Journla of the Institute of Mathematics and Applications, Vol. 6, pp. 222–231, 1970.

    Google Scholar 

  2. Fletcher, R.,A New Approach to Variable Metric Algorithms, Computer Journal, Vol. 13, pp. 317–322, 1970.

    Google Scholar 

  3. Goldfarb, D.,A Family of Variable Metric Algorithms Derived by Variational Means, Mathematics of Computation, Vol. 24, pp. 23–26, 1970.

    Google Scholar 

  4. Shanno, D. F.,Conditioning of Quasi-Newton Methods for Function Minimization, Mathematics of Computation, Vol. 24, pp. 647–656, 1970.

    Google Scholar 

  5. Shanno, D. F., andPhua, K. H.,Matrix Conditioning and Nonlinear Optimization, Mathematical Programming, Vol. 14, pp. 149–160, 1978.

    Google Scholar 

  6. Shanno, D. F., Berg, A., andCheston, G.,Restarts and Rotations of Quasi-Newton Methods, Information Processing 74, Edited by J. L. Rosenfeld, North-Holland Publishing Company, Amsterdam, Holland, 1974.

    Google Scholar 

  7. Shanno, D. F., andPhua, K. H.,Minimization of Unconstrained Multivariate Functions, ACM Transactions on Mathematical Software, Vol. 2, pp. 87–94, 1976.

    Google Scholar 

  8. Powell, M. J. D.,A New Algorithm for Unconstrained Optimization, Nonlinear Programming, Edited by J. B. Rosen, O. C. Mangasarian, and K. Ritter, Academic Press, New York, New York, 1970.

    Google Scholar 

  9. Dennis, J. E., andMei, H. H. W.,An Unconstrained Optimization Algorithm Which Uses Function and Gradient Values, Cornell University, Computer Science Department, Technical Report No. 75-246, 1975.

  10. Davidon, W. C.,Optimally Conditioned Optimization Algorithms Without Line Searches, Mathematical Programming, Vol. 9, pp. 1–30, 1975.

    Google Scholar 

  11. Fletcher, R., andPowell, M. J. D.,On the Modification of LDL' Factorizations, Atomic Energy Research Establishment, Harwell, England, Report No. HL73/6036, 1973.

    Google Scholar 

  12. Turner, P. R.,The Use of Projections and Factorization in Optimization Algorithms, University of Lancaster, Lancaster, England, Department of Mathematics, Working Paper, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by H. Y. Huang

This research was supported by the National Science Foundation under Research Grant No. MCS77-07327.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shanno, D.F., Phua, K.H. Numerical comparison of several variable-metric algorithms. J Optim Theory Appl 25, 507–518 (1978). https://doi.org/10.1007/BF00933517

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00933517

Key Words

Navigation