Dynamic Programming Principle for One Kind of Stochastic Recursive Optimal Control Problem and Hamilton–Jacobi–Bellman Equation
Zhen Wu, Zhiyong Yu
Abstract
Zhen Wu, Zhiyong Yu
Abstract
In this paper, we study one kind of stochastic recursive optimal control problem with the obstacle constraint for the cost functional described by the solution of a reflected backward stochastic differential equation. We give the dynamic programming principle for this kind of optimal control problem and show that the value function is the unique viscosity solution of the obstacle problem for the corresponding Hamilton–Jacobi–Bellman equation.
OpenAlex reports 67 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, we study one kind of stochastic recursive optimal control problem with the obstacle constraint for the cost functional described by the solution of a reflected backward stochastic differential equation. We give the dynamic programming principle for this kind of optimal control problem and show that the value function is the unique viscosity solution of the obstacle problem for the corresponding Hamilton–Jacobi–Bellman equation.
Key concepts: Bellman equation, Dynamic programming, Viscosity solution, Optimal control, Mathematics, Hamilton–Jacobi equation, Hamilton–Jacobi–Bellman equation, Stochastic control