Weak dynamic programming for generalized state constraints

From MaRDI portal




Abstract: We provide a dynamic programming principle for stochastic optimal control problems with expectation constraints. A weak formulation, using test functions and a probabilistic relaxation of the constraint, avoids restrictions related to a measurable selection but still implies the Hamilton-Jacobi-Bellman equation in the viscosity sense. We treat open state constraints as a special case of expectation constraints and prove a comparison theorem to obtain the equation for closed state constraints.




Cited in
(28)








This page was built for publication: Weak dynamic programming for generalized state constraints

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