Weak Dynamic Programming for Generalized State Constraints
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.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.Bibliographic Info
Paper provided by arXiv.org in its series Papers with number 1105.0745.Length:
Date of creation: May 2011
Date of revision: Oct 2012
Publication status: Published in SIAM Journal on Control and Optimization, Vol. 50, No. 6, pp. 3344-3373, 2012
Handle: RePEc:arx:papers:1105.0745
Contact details of provider:
Web page: http://arxiv.org/
Related research
Keywords:This paper has been announced in the following NEP Reports:
- NEP-ALL-2011-05-24 (All new papers)
- NEP-DGE-2011-05-24 (Dynamic General Equilibrium)
References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.Cited by:
- Bruno Bouchard & Ludovic Moreau & Marcel Nutz, 2012. "Stochastic Target Games with Controlled Loss," Papers 1206.6325, arXiv.org, revised May 2013.
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:arx:papers:1105.0745For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (arXiv administrators).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

