|Publication ahead of print|
|Published online||19 January 2018|
Dynamic programming principle and associated Hamilton-Jacobi-Bellman equation for stochastic recursive control problem with non-Lipschitz aggregator
1 School of Finance, Shanghai Lixin University of Accounting and Finance, Shanghai 201209, China.
2 School of Mathematical Sciences, Fudan University, Shanghai 200433, China.
Received: 25 August 2015
Revised: 7 September 2016
Accepted: 10 February 2017
In this work we study the stochastic recursive control problem, in which the aggregator (or generator) of the backward stochastic differential equation describing the running cost is continuous but not necessarily Lipschitz with respect to the first unknown variable and the control, and monotonic with respect to the first unknown variable. The dynamic programming principle and the connection between the value function and the viscosity solution of the associated Hamilton-Jacobi-Bellman equation are established in this setting by the generalized comparison theorem for backward stochastic differential equations and the stability of viscosity solutions. Finally we take the control problem of continuous-time Epstein−Zin utility with non-Lipschitz aggregator as an example to demonstrate the application of our study.
Mathematics Subject Classification: 93E20 / 90C39 / 35K10
Key words: Stochastic recursive control problem / non-Lipschitz aggregator / dynamic programming principle / Hamilton-Jacobi-Bellman equation / continuous-time Epstein−Zin utility / viscosity solution
© EDP Sciences, SMAI 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.