Convex Duality Approach to the Optimal Control of Diffusions
Authors:
- Wendell H. FlemingWFWendell H. Fleming
- Domokos VermesDVDomokos Vermes
- 1 September 1989
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 27 (5) , 1136-1155
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Optimal control of piecewise deterministic markov processStochastics, 1985
- Optimal control of diffustion processes and hamilton-jacobi-bellman equations part I: the dynamic programming principle and applicationCommunications in Partial Differential Equations, 1983
- A Necessary and Sufficient Condition for Optimality of Dynamic Programming Type, Making No a Priori Assumptions on the ControlsSIAM Journal on Control and Optimization, 1978
- The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal ControlSIAM Journal on Control and Optimization, 1978
- Conjugate convex functions in optimal stochastic controlJournal of Mathematical Analysis and Applications, 1973
- Conjugate convex functions in optimal control and the calculus of variationsJournal of Mathematical Analysis and Applications, 1970
- Extension of Fenchel’ duality theorem for convex functionsDuke Mathematical Journal, 1966