The theory of dynamic programming treats problems involving multi-stage processes by means of a transformation of the problem from the space of decisions to the space of functions. This is ...

In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...