Skip to main content
Log in

On a conjecture of Dixon and other topics in variable metric methods

  • Published:
Mathematical Programming Submit manuscript

Abstract

A conjecture of Dixon relating to the behaviour of variable metric methods on functions with special symmetry is validated under suitable onditions. The relation between Huang's class and Oren's class is explored. Then the equivalence of Davidon's and Oren and Spedicato's approaches to optimal conditioning is demonstrated.

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. C.G. Broyden, “Quasi-Newton methods and their application to function minimization”,Mathematics of Computation 21 (1967) 368–381.

    Google Scholar 

  2. H.Y. Huang, “Unified approach to quadratically convergent algorithms for function minimization”,Journal of Optimization Theory and Applications 5 (1970) 405–423.

    Google Scholar 

  3. S.S. Oren, “Self-scaling variable metric algorithms for unconstrained minimization”, Ph.D. Thesis, Department of Engineering Economic Systems, Stanford University (1972).

  4. L.C.W. Dixon, “Nonlinear optimization: a survey”, in: D.J. Evans, ed., Software for numerical mathematics (Academic Press, New York, 1974) pp. 193–218.

    Google Scholar 

  5. S.S. Oren and E. Spedicato, “Optimal conditioning of self-scaling variable metric algorithms”,Mathematical Programming 10 (1976) 70–90.

    Google Scholar 

  6. W.C. Davidon, “Optimally conditioned optimization algorithms without line searches”,Mathematical Programming 9 (1975) 1–30.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Spedicato, E. On a conjecture of Dixon and other topics in variable metric methods. Mathematical Programming 15, 123–129 (1978). https://doi.org/10.1007/BF01609011

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Navigation