Skip to main content
Log in

Accelerating procedures for methods of conjugate directions

Beschleunigte Verfahren für Methoden der konjugierten Richtungen

  • Published:
Computing Aims and scope Submit manuscript

Abstract

Methods of conjugate directions and reset versions of the conjugate gradient method have ann-step quadratic rate of convergence when they are applied to the unconstrained minimization of a function ofn variables. A set ofn consecutive directions of descent generated by one of these methods contains information on the function to be minimized which is used to accelerate the convergence by perorming simple special steps. Under appropriate assumptions the rate of convergence of an accelerated reset version of the conjugate gradient method is (n+1)-step cubic. Depending on the frequency of the special step the rate of convergence of the method of conjugate directions is (n+1)-step cubic or 2-step superlinear.

Zusammenfassung

Es ist bekannt, daß die Anwendung von Methoden der konjugierten Richtungen sowie von geeigneten Modifikationen der Methode der konjugierten Gradienten zur Bestimmung des Minimums einer Funktion vonn Variablen einen-Schritt quadratische Konvergenzgeschwindigkeit ergibt. Eine Menge vonn aufeinanderfolgenden Richtungsvektoren, die von einer dieser Methoden erzeugt worden sind, enthalten Information über die zu minimierende Funktion, die dazu benutzt werden kann, die Konvergenzgeschwindigkeit zu erhöhen durch Ausführung besonderer Iterationsschritte. Unter geeigneten Voraussetzungen ergibt sich für die beschleunigte Methode der konjugierten Gradienten eine (n+1)-Schritt kubische Konvergenzgeschwindigkeit. Die Konvergenzgeschwindigkeit der beschleunigten Methode der konjugierten Richtungen ist in Abhängigkeit von der Häufigkeit der besonderen Iterationsschritte entweder (n+1)-Schritt kubisch oder 2-Schritt superlinear.

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. Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pacific Journal of Mathematics16, 1–3 (1966).

    Article  MathSciNet  MATH  Google Scholar 

  2. Best, M. J., Ritter, K.: An accelerated conjugate direction method to solve linearly constrained minimization problems. Research Report CORR 73-16. University of Waterloo. Canada, 1973.

    MATH  Google Scholar 

  3. Cohen, A.: Rate of convergence of several conjugate gradient algorithms. SIAM, Journal of Numerical Analysis9, 248–259 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  4. Dieudonnée, J.: Foundations of modern analysis. New York: Academic Press 1960.

    Google Scholar 

  5. Goldstein, A. A.: Constructive real analysis. New York: Harper and Row 1967.

    MATH  Google Scholar 

  6. Klessig, R., Polak, E.: Efficient implementations of the Polak-Ribiere conjugate gradient algorithm. Memorandum No. ERL M 279, Electronics Research Laboratory, University of California, 1970.

  7. McCormick, G. P., Ritter, K.: On the projection method for unconstrained optimization. Journal for Optimization Theory and Application10, 57–66 (1972).

    Article  MathSciNet  MATH  Google Scholar 

  8. McCormick, G. P., Ritter, K.: Alternative proofs of the convergence properties of the conjugate gradient method. Journal for Optimization Theory and Applications13, 497–518 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  9. Polak, E.: Computational methods in optimization. New York: Academic Press 1971.

    Google Scholar 

  10. Ritter, K.: A superlinearly convergent method for unconstrained minimization problems, in: Nonlinear programming (Rosen, J. B., Mangasarian, O. L., Ritter, K., eds.). New York: Academic Press 1970.

    Google Scholar 

  11. Ritter, K.: A method of conjugate directions for unconstrained minimization, in: Methods of operations research I (Henn, R., Künzi, H. P., Schubert, H., eds.). Meisenheim: Verlag Anton Hain 1972.

    Google Scholar 

  12. Ritter, K.: A method of conjugate directions for nonlinear programming problems. SIAM Journal of Numerical Analysis (to appear).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ritter, K. Accelerating procedures for methods of conjugate directions. Computing 14, 79–105 (1975). https://doi.org/10.1007/BF02242308

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation