Skip to main content
SpringerLink
Log in

On the rate of superlinear convergence of a class of variable metric methods

  • Sign-Stability in Difference Schemes for Parabolic Initinal-Boundary Value Problems
  • Published:
Numerische Mathematik Aims and scope Submit manuscript

Summary

This paper considers a class of variable metric methods for unconstrained minimization. Without requiring exact line searches each algorithm in this class converges globally and superlinearly on convex functions. Various results on the rate of the superlinear convergence are obtained.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Broyden, C.G.: Quasi-Newton methods and their application to function minimization. Math. Comput.21, 368–381 (1967)

    Google Scholar 

  2. Broyden, C.G.: The convergence of a class of double-rank minimization algorithms, Parts 1 and 2. J. Inst. Math. Appl.6, 76–90, 222–231 (1970)

    Google Scholar 

  3. Burmeister, W.: Die Konvergenzordnung des Fletcher-Powell-Algorithmus. Z. Angew. Math. Mech.53, 693–699 (1973)

    Google Scholar 

  4. Davidon, W.C.: Variable metric methods for minimization. Argonne National Laboratories rept. ANL-5990 (1959)

  5. Dixon, L.C.W.: Variable metric algorithms: necessary and sufficient conditions for identical behaviour on non-quadratic functions. J. Optimization Theory Appl.10, 34–40 (1972)

    Google Scholar 

  6. Fletcher, R.: A new approach to variable metric algorithms. Comput. J.13, 317–322 (1970)

    Google Scholar 

  7. Fletcher, R., Powell, M.J.D.: A rapidly convergent descent method for minimization. Comput. J.6, 163–168 (1963)

    Google Scholar 

  8. Goldfarb, D.: A family of variable metric methods derived by variational means. Math. Comput.24, 23–26 (1970)

    Google Scholar 

  9. Huang, H.Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Optimization Theory Appl.5, 405–423 (1970)

    Google Scholar 

  10. Noble, B.: Applied linear algebra. New York: Prentice-Hall, 1969

    Google Scholar 

  11. Ritter, K.: Global and superlinear convergence of a class of variable metric methods. Mathematics Research Center TSR # 1945, University of Wisconsin-Madison 1979

  12. Schuller, G.: On the order of convergence of certain quasi-Newton Methods. Numer. Math.23, 181–192 (1974)

    Google Scholar 

  13. Shanno, D.F.: conditioning of quasi-Newton methods for function minimization. Math. Comput.24, 647–656 (1970)

    Google Scholar 

  14. Stoer, J.: On the convergence rate of imperfect minimization algorithms in Broyden.s β-class. Math. Programming9, 313–335 (1975)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut A, Universität Stuttgart, Pfaffenwaldring 57/9, D-7000, Stuttgart 80, Germany (Fed. Rep.)

    Klaus Ritter

Authors
  1. Klaus Ritter
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Dedicated to Professor Dr. H. Görtler on the occasion of his seventieth birthday

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ritter, K. On the rate of superlinear convergence of a class of variable metric methods. Numer. Math. 35, 293–313 (1980). https://doi.org/10.1007/BF01396414

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Subject Classifications

Search

Navigation