Dynamic programming in convex stochastic optimization
Optimization and Control
2022-04-01 v1
Abstract
This paper studies the dynamic programming principle for general convex stochastic optimization problems introduced by Rockafellar and Wets in [30]. We extend the applicability of the theory by relaxing compactness and boundedness assumptions. In the context of financial mathematics, the relaxed assumption are satisfied under the well-known no-arbitrage condition and the reasonable asymptotic elasticity condition of the utility function. Besides financial mathematics, we obtain several new results in linear and nonlinear stochastic programming and stochastic optimal control.
Cite
@article{arxiv.2203.17107,
title = {Dynamic programming in convex stochastic optimization},
author = {Teemu Pennanen and Ari-Pekka Perkkiö},
journal= {arXiv preprint arXiv:2203.17107},
year = {2022}
}