Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
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. In particular, we derive estimates of the Lipschitz constant of the value function, by means of a regularity result of the multifunction that defines the admissible control set. Copyright © 2006 Watam Press.
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control