Skip to main content
Log in

An extension of Curry's theorem to steepest descent in normed linear spaces

  • Published:
Mathematical Programming Submit manuscript

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.

References

  1. P.T. Boggs and J.E. Dennis, Jr., “An analysis of the discretized analog of steepest descent”, to appear.

  2. A. Cauchy, “Methode générale pour la résolution des systems d'equations simultanes”,Comptes Rendus Ilebdomadaires des Séances de l'Academic des Sciences 25 (1847) 536–538.

    Google Scholar 

  3. D.F. Cudia, “The geometry of Banach spaces: Smoothness”,Transactions of the American Mathematical Society 110 (1964) 284–314.

    Google Scholar 

  4. H.B. Curry, “The method of steepest descent for nonlinear minimization problems”,The Quarterly Journal of Mechanics and Applied Mathematics 2 (1944) 258–261.

    Google Scholar 

  5. J.W. Daniel,“The approximate minimization of funetionals” (Prentice-Hall, Englewood Cliffs, N.J., 1971).

    Google Scholar 

  6. A.A. Goldstein, “Convex programming in Hilbert space”,Bulletin of the American Mathematical Society 70 (1964) 709–710.

    Google Scholar 

  7. A.A. Goldstein, “Constructive real analysis” (Harper and Row, New York, 1967).

    Google Scholar 

  8. M. Golomb, “Zur theorie der nichlinear Integral-gleichungen, Integral-gleichungssystem und allgemeinen Functional-gleichungen”,Mathematische Zeitschrift 39 (1934) 45–75.

    Google Scholar 

  9. M. Golomb and R.A. Tapia, “The metric gradient in normed linear spaces”,Numerische Mathematik 20 (1972) 115–124.

    Google Scholar 

  10. L.V. Kantorovich, “On an effective method of solution of extremal problems for a quadratic functional”,Doklady Akademii Nauk SSSR 4 (1945) 531–538.

    Google Scholar 

  11. L.V. Kantorovich and G.P. Akilov, “Functional analysis in normed spaces” (Pergamon, New York, 1964).

    Google Scholar 

  12. D.G. Luenberger, “Introduction to linear and nonlinear programming” (Addison-Wesley, Reading, Mass., 1973).

    Google Scholar 

  13. G.P. McCormick, and R.A. Tapia, “The gradient projection method under mild differentiability conditions”,SIAMJournal on Control 10 (1972) 93–98.

    Google Scholar 

  14. J.M. Ortega and W.C. Rheinboldt, “Iterative solution of nonlinear equations in several variables” (Academic Press, New York, 1970).

    Google Scholar 

  15. R.V. Southwell, “Stress calculations in frameworks by the method of systematic relaxation of constraints”,Proceedings of the Royal Society 151 (1935) 56–95.

    Google Scholar 

  16. R.A. Tapia, “A characterization of inner product spaces”,Proceedings of the American Mathematical Society 41 (1973) 569–574.

    Google Scholar 

  17. P. Wolfe, “Convergence conditions for ascent methods”,SIAM Review 11 (1969) 226–234.

    Google Scholar 

  18. P. Wolfe, “Convergence conditions for ascent methods II: Some corrections”,SIAM Review 13 (1971) 185–188.

    Google Scholar 

  19. W.I. Zangwill, “Nonlinear programming: a unified approach” (Prentice-Hall, Englewood Cliffs, N.J., 1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Byrd, R.H., Tapia, R.A. An extension of Curry's theorem to steepest descent in normed linear spaces. Mathematical Programming 9, 247–254 (1975). https://doi.org/10.1007/BF01681347

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation