Lipschitzian Estimates in Discrete-Time Constrained Stochastic Optimal Control
M. Papi, S. Sbaraglia
Abstract
This paper is devoted to the analysis of a finite horizon discrete-time stochastic optimal control problem, in presence of constraints. We study the regularity of the value function which comes from the dynamic programming algorithm. We derive accurate estimates of the Lipschitz constant of the value function, by means of a regularity result of the multifunction that defines the admissible control set. In the last section we discuss an application to an optimal asset-allocation problem.
Create a lesson
Related papers
Beyond Expected Profit: How Risk Aversion Alters Learning in the Data-Driven Newsvendor
Omar Besbes, Alon Rieger
Optimal Subsidy Design for Productive Investment across Markets
Alexandros Pavlis
Descending Everest, Part II: Oracle Complexity of Minimizing a Sum of Convex (L0,L1)-Smooth Functions
Mikhail Rudomanov, Ivan Fomin, Alexander V. Gasnikov et al.
Infinite-Horizon Stochastic Recursive Differential Games with Jumps: Nonautonomous Coefficients and Nonzero Terminal Values
Sheng Luo, Qingmeng Wei, Yaxin Wen
Exact penalty methods with adaptive discretization for nonsmooth semi-infinite optimization
Giancarlo Bigi, Riccardo Tomassini
A Triangular Log-Det PDHG for Semidefinite Programming: Complementarity Selection and Global Linear Convergence
Lijun Ding, Jinwen Yang