Approximate Linear Programming for Average Cost MDPs

References

• Bertsekas DP. Dynamic Programming and Optimal Control (2007) 23rd ed.(Athena Scientific, Belmont, MA) Google Scholar
• de Farias DP, Van Roy B. Approximate linear programming for average-cost dynamic programming. Advances in Neural Information Processing Systems 15 (2003) (MIT Press, Cambridge) Google Scholar
• de Farias DP, Van Roy B. The linear programming approach to approximate dynamic programming. Oper. Res. (2003) 51(6):850–865Link, Google Scholar
• de Farias DP, Van Roy B. On constraint sampling for the linear programming approach to approximate dynamic programming. Math. Oper. Res. (2004) 29(3):462–478Link, Google Scholar
• de Farias DP, Van Roy B. A cost-shaping linear program for average-cost approximate dynamic programming with performance guarantees. Math. Oper. Res. (2006) 31(3):597–620Link, Google Scholar
• de Farias DP, Weber T. Choosing the cost vector of the linear programming approach to approximate dynamic programming. 47th IEEE Conference on Decision and Control (2008) 67–72 http://dx.doi.org/10.1109/CDC.2008.4739452Crossref, Google Scholar
• Desai VV, Farias VF, Moallemi CC. Approximate dynamic programming via a smoothed linear program. Oper. Res. (2009) 60(3):655–674Link, Google Scholar
• Martin DH. On the continuity of the maximum in parametric linear programming. J. Optim. Theory Appl. (1975) 17(3):205–210Crossref, Google Scholar
• Petrik M, Zilberstein S, Bottou L, Littman M. Constraint relaxation in approximate linear programs. Proc. 26th Internat. Conf. Machine Learn. (2009) (Omnipress, Montreal) 809–816Crossref, Google Scholar
• Puterman ML. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1994) (John Wiley & Sons, New York) Crossref, Google Scholar
• Schweitzer P, Seidmann A. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. (1985) 110:568–582Crossref, Google Scholar
• Sennott LI. Stochastic Dynamic Programming and the Control of Queueing Systems (1999) (John Wiley & Sons, New York) Google Scholar
• Veatch MH. Approximate linear programming for networks: Average cost bounds. (2010) . Working paper, Department of Math., Gordon College, http://faculty.gordon.edu/ns/mc/mike_veatch/documents/reduction2.pdfGoogle Scholar