Skip to main content
Log in

Stability, prediction-correction, and dynamic programming

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

Abstract

It is proven here that a bounded perturbation of the discrete dynamic programming functional equation arising from the Bolza problem yields a bounded change in its solution. This stability property encourages the development of approximation techniques for solving such equations. One such technique, involving the backward solution of an approximate functional equation as a prediction step, followed by a forward reconstruction using true equations as a correction step, is then discussed. Bounds for the errors arising from such an approximation procedure are derived. Successive approximations is suggested, in conclusion, as a means for obtaining improved solutions.

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. Bellman, R.,Introduction to the Mathematical Theory of Control Processes, Volume 2, Academic Press, New York, New York, 1971.

    Google Scholar 

  2. Fox, B. L.,Discretizing Dynamic Programs, Journal of Optimization Theory and Applications, Vol. 11, No. 3, 1973.

  3. Bellman, R., andKalaba, R.,Dynamic Programming and Modern Control Theory, Academic Press, New York, New York, 1965.

    Google Scholar 

  4. Lew, A.,A Predictor-Corrector Method for Dynamic Programming, IEEE Transactions on Automatic Control, Vol. 19, No. 1, 1974.

  5. Bellman, R. E., andKalaba, R. E.,Quasilinearization and Nonlinear Boundary-Value Problems, American Elsevier Publishing Company, New York, New York, 1965.

    MATH  Google Scholar 

  6. Bellman, R., andDreyfus, S.,Applied Dynamic Programming, Appendix 3, Princeton University Press, Princeton, New Jersey, 1962.

    MATH  Google Scholar 

  7. Lew, A.,Reduction of Dimensionality by Approximation Techniques: Diffusion Processes, Journal of Mathematical Analysis and Applications, Vol. 38, No. 1, 1972.

  8. Collins, D.,Reduction of Dimensionality in Dynamic Programming via the Method of Diagonal Decomposition, Journal of Mathematical Analysis and Applications, Vol. 30, No. 1, 1970.

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by R. E. Kalaba

This research was supported in part by the National Science Foundation under Grant No. GP-29049, in part by the Atomic Energy Commission, Division of Research, under Contract No. AT(40-3)-113, Project 19, and in part by the US Army Research Office, under Grant No. DAHC04-74-G-0110.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lew, A. Stability, prediction-correction, and dynamic programming. J Optim Theory Appl 17, 239–250 (1975). https://doi.org/10.1007/BF00933878

Download citation

  • Published:

  • Issue Date:

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

Key Words

Navigation