Skip to main content
SpringerLink
Log in

Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations

  • Published:
Applied Mathematics and Optimization Submit manuscript

Abstract

We focus on numerically solving a typical type of Hamilton-Jacobi-Bellman (HJB) equations arising from a class of optimal controls with a standard multidimensional diffusion model. Solving such an equation results in the value function and an optimal feedback control law. The Bellman's curse of dimensionality seems to be the main obstacle to applicability of most numerical algorithms for solving HJB. We decompose HJB into a number of lower-dimensional problems, and discuss how the usual alternating direction method can be extended for solving HJB. We present some convergence results, as well as preliminary experimental outcomes.

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. Bartels RH, Stewart GW (1972) Algorithm 432, solution of the matrix equation AX+XB=C, Comm. ACM 15:820–826

    Google Scholar 

  2. Bellman R (1961) Adaptive Control Processes: A Guided Tour, Princeton University Press, New Jersey

    Google Scholar 

  3. Douglas J, Rachford HH (1956) On the numerical solution of heat conduction problems in two or three space variables, Trans. Amer. Math. Soc. 82:421–439

    Google Scholar 

  4. Duff IS, Erisman A, Reid J (1986) Direct Methods for Sparse Matrices, Clarendon Press, Oxford

    Google Scholar 

  5. Kellog RB (1969) A nonlinear alternating direction method, Math. Comp. 23:23–27

    Google Scholar 

  6. Kushner HJ, Dupuis PG (1992) Numerical Methods for Stochastic Control Problems in Continuous Time, Springer-Verlag, New York

    Google Scholar 

  7. Ortega JM, Rheinboldt WC (1970) Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York

    Google Scholar 

  8. Peaceman DW, Rachford HH (1955) The numerical solution of parabolic and elliptic differential equations, J. SIAM 3:28–41

    Google Scholar 

  9. Smith RA (1968) Matrix equation XA+BX=C, SIAM J. Applied Math. 16:198–201

    Google Scholar 

  10. Sun M (1990) Numerical solutions of singular stochastic control problems in bounded intervals, Lectures in Applied Mathematics, AMS, 26:619–643

    Google Scholar 

  11. Sun M (1990) Iterative algorithms for solving undiscounted Bellman equations, Numer. Func. Anal. Optim. 11:149–166

    Google Scholar 

  12. Sun M (1993) Domain decomposition algorithms for solving Hamilton-Jacobi-Bellman equations, Numer. Func. Anal. Optim. 14:145–166

    Google Scholar 

  13. Tewarson R (1973) Sparse Matrices, Academic Press, New York

    Google Scholar 

  14. Varga RS (1962) Matrix Iterative Analysis, Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The University of Alabama, 35487, University, AL, USA

    M. Sun

Authors
  1. M. Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was funded in part by an RGC grant from the University of Alabama.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, M. Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations. Appl Math Optim 34, 267–277 (1996). https://doi.org/10.1007/BF01182626

Download citation

  • Accepted:

  • Issue Date:

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

Key words

AMS classification

Search

Navigation