Mild solutions to the dynamic programming equation for stochastic optimal control problems
Abstract
We show via the nonlinear semigroup theory in L1(R) that the 1-D dynamic programming equation associated with a stochastic optimal control problem with multiplicative noise has a unique mild solution ∈ C([0,T];W1,∞(R)) with xx∈ C([0,T];L1(R)). The n-dimensional case is also investigated.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.