Approximate Dynamic Programming via a Smoothed Linear Program
We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural “projection” of a well-studied linear program for exact dynamic programming. Such...
Main Authors: | Desai, Vijay V., Farias, Vivek F., Moallemi, Ciamac C. |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | en_US |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2012
|
Online Access: | http://hdl.handle.net/1721.1/75033 https://orcid.org/0000-0002-5856-9246 |
Similar Items
-
Non-Parametric Approximate Dynamic Programming via the Kernel Method
by: Bhat, Nikhil, et al.
Published: (2014) -
Bounds for Markov Decision Processes
by: Desai, Vijay V., et al.
Published: (2019) -
An approximate dynamic programming approach to solving dynamic oligopoly models
by: Farias, Vivek F., et al.
Published: (2012) -
Near-Optimal A-B Testing
by: Bhat, Nikhil, et al.
Published: (2021) -
Universal Reinforcement Learning
by: Farias, Vivek F., et al.
Published: (2010)