Convex duality approach to the optimal control of diffusions

An alternative to the usual dynamic programming approach to the optimal control of Markov processes is considered. It is based on duality of convex analysis. The control problem is embedded in a convex mathematical programming problem on a space of measures. The dual problem is to find the supremum of smooth subsolutions to the Hamilton–Jacobi–Bellman equation.