Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
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.
Arnon Amir, Michael Lindenbaum
IEEE Transactions on Pattern Analysis and Machine Intelligence
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997