Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations

From MaRDI portal





The author is interested in solving efficiently a discretized version of the Hamilton-Jacobi-Bellman equations resulting from an optimal control problem. He suggests to decompose the original problem into a number of lower-dimensional problems and studies how the usual alternating direction method can be extended for solving this type of equations. He also presents some convergence results.





Describes a project that uses

Uses Software






This page was built for publication: Alternating direction algorithms for solving Hamilton-Jacobi-Bellman equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1925030)