Skip to main content
SpringerLink
Log in

Steepest-descent failure analysis

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

An extensive failure analysis of the steepest-descent optimization algorithm has been made. Each of the ways in which the algorithm can fail is discussed in terms of both the mathematical and numerical manifestations of a failure and the information which each type of failure provides about the formulation of the physical problem. Numerical tests for each of the various types of failure are described; several faulty problem formulations are presented, each of which illustrates a particular type of failure. A table is presented in which all failure modes are summarized and the corresponding numerical tests are exhibited.

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. Denham, W. F.,Steepest-Ascent Solution of Optimal Programming Problems, The Raytheon Company Report No. BR-2393, 1963.

  2. Bryson, A. E., Jr., andDenham, W. F.,A Steepest-Ascent Method for Solving Optimum Programming problems, Journal of Applied Mechanics, Vol. 84, No. 2, 1962.

  3. Bryson, A. E., Jr., Denham, W. F., andDreyfus, S. E.,Optimal programming Problems with Inequality Constraints, I: Necessary Conditions for Extremal Solutions, AIAA Journal, Vol. 1, No. 11, 1963.

  4. Denham, W. F., andBryson, A. E. Jr.,Optimal Programming problems with Inequality Constraints, II: Solution by Steepest-Ascent, AIAA Journal, Vol. 2, No. 1, 1964.

  5. Kelley, H. J.,Gradient Theory of Optimal Flight Paths, ARS Journal, Vol. 30, No. 10, 1960.

  6. Kelley, H. J.,Method of Gradients, Optimization Techniques, Edited by G. Leitmann, Academic Press, New York, New York, 1962.

    Google Scholar 

  7. Long, R. S.,Newton-Raphson Operator; Problems with Undetermined End Points, AIAA Journal, Vol. 3, No. 5, 1969.

  8. Miele, A., Pritchard, R. E., andDamoulakis, J. N.,Sequential Gradient-Restoration Algorithm for Optimal Control Problems, Journal of Optimization Theory and Applications, Vol. 5, No. 4, 1970.

  9. Miele, A.,Recent Advances in Gradient Algorithms for Optimal Control Problems (Survey Paper), Journal of Optimization Theory and Applications, Vol. 17, Nos. 5/6, 1975.

  10. Zadeh, L. A., andDesour, C. A.,Linear System Theory, McGraw-Hill Book Company, New York, New York, 1963.

    Google Scholar 

  11. Kalman, R. E., Ho, Y. C., andNarendra, K. S.,Controllability of Linear Dynamical Systems, Contributions to Differential Equations, Vol. 1, No. 2, 1962.

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Engineering, Texas A&M University, College Station, Texas

    M. McDermott Jr. (Assistant Professor)

  2. Department of Aerospace Engineering and Engineering Mechanics, The University of Texas at Austin, Austin, Texas

    W. T. Fowler (Associate Professor)

Authors
  1. M. McDermott Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. T. Fowler
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by A. Miele

Rights and permissions

Reprints and permissions

About this article

Cite this article

McDermott, M., Fowler, W.T. Steepest-descent failure analysis. J Optim Theory Appl 23, 229–243 (1977). https://doi.org/10.1007/BF00933050

Download citation

  • Issue Date:

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

Key Words

Search

Navigation