Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 95 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 25 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 159 tok/s Pro
GPT OSS 120B 391 tok/s Pro
Claude Sonnet 4 Pro
2000 character limit reached

Dynamic Programming Principle and Associated Hamilton-Jacobi-Bellman Equation for Stochastic Recursive Control Problem with Non-Lipschitz Aggregator (1503.02180v2)

Published 7 Mar 2015 in math.OC

Abstract: In this work we study the stochastic recursive control problem, in which the aggregator (or called 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 of 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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (2)