A numerical algorithm based on a variational iterative approximation for the discrete Hamilton–Jacobi–Bellman (HJB) equation

This paper presents a numerical algorithm based on a variational iterative approximation for the Hamilton–Jacobi–Bellman equation, and a domain decomposition technique based on this algorithm is also studied. The convergence theorems have been established. Numerical results indicate the efficiency and accuracy of the methods.