Discretizing dynamic programs
暂无分享,去创建一个
Discretizing certain discrete-time, uncountable-state dynamic programs such that the respective solutions to a sequence of discretized versions converge uniformly to the solution of the original problem is shown. Via a random perturbation device, we apply our general approach to a separable nonconvex program.
[1] E. Denardo. CONTRACTION MAPPINGS IN THE THEORY UNDERLYING DYNAMIC PROGRAMMING , 1967 .
[2] J. E. Falk,et al. An Algorithm for Separable Nonconvex Programming Problems , 1969 .
[3] B. Fox. Finite-state approximations to denumerable-state dynamic programs , 1971 .
[4] J. Rolph,et al. A Countable Policy Set for Sequential Decision Problems , 1972 .