Skip to main content
Log in

On the convergence of variable-metric methods

Über die Konvergenz von Methoden der variablen Metrik

  • Published:
Computing Aims and scope Submit manuscript

Abstract

In this paper the convergence of variablemetric methods is considered. The minimum of a quadratic function is attained with a number of iterations equal to the rank of the Hessian matrix of the function. Under certain conditions the sequence of variable-metric matrices tends to the pseudoinverse of the Hessian matrix.

Zusammenfassung

In dieser Arbeit wird die Konvergenz von Methoden der variablen Metrik zur Minimalisierung betrachtet. Das Minimum einer quadratischen Funktion wird erreicht durch eine Zahl von Iterationen, die gleich dem Rang der Hesseschen Matrix der Funktion ist. Unter gewissen Bedingungen konvergiert die Folge von Matrizen der Methode der variablen Metrik gegen die Pseudoinverse der Hesseschen Matrix.

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. Goldfarb, D.: A family of variable-metric methods derived by variational means. Math. Comp.24, 23–26 (1970).

    Google Scholar 

  2. Huang, H. Y.: Unified approach to quadratically convergent algorithms for function minimization. J. Opt. Th. and Appl.6, 269–282 (1970).

    Google Scholar 

  3. Tewarson, R. P.: On the use of generalized inverses in function minimization. Comp.6, 241–248 (1970).

    Google Scholar 

  4. Adachi, N.: On variable-metric algorithms. J. Opt. Th. and Appl.7, 391–410 (1971).

    Google Scholar 

  5. Ben-Israel, A., andA. Charnes: Contributions to the theory of generalized inverses. J. SIAM11, 667–699 (1963).

    Google Scholar 

  6. Desoyer, C. A., andB. H. Whalen: A note on pseudoinverses. J. SIAM11, 442–447 (1963).

    Google Scholar 

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

    Google Scholar 

  8. Goldfarb, D.: Sufficient conditions for the convergence of a variable-metric algorithm, in Optimization (Powell, R., ed.), p. 273–281. New York-London: Academic Press. 1969.

    Google Scholar 

  9. Greenstadt, J.: Variations on variable-metric methods. Math. Comp.24, 1–22 (1970).

    Google Scholar 

  10. Adachi, N.: On the uniqueness of search directions in variable-metric algorithms, to be published in J. Opt. Th. and Appl.11.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adachi, N. On the convergence of variable-metric methods. Computing 11, 111–123 (1973). https://doi.org/10.1007/BF02252901

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation