On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming

Published Online:https://doi.org/10.1287/moor.1040.0094

References

  • Anthony D., Biggs N.Computational Learning Theory (1992) (Cambridge University Press, Cambridge, UK) 95Google Scholar
  • Bertsekas D., Tsitsiklis J. N.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
  • Calafiore G., Campi M. Uncertain convex programs: Randomized solutions and confidence levels. (2003) . PreprintGoogle Scholar
  • Clarkson K. L. Las Vegas algorithms for linear and integer programming when the dimension is small. J. Assoc. Comput. Machinery (1995) 42(2):488–499CrossrefGoogle Scholar
  • de Farias D. P., Van Roy B. The linear programming approach to approximate dynamic programming. Oper. Res. (2003) 51(6):850–865LinkGoogle Scholar
  • Dudley R. M. Central limit theorems for empirical measures. Ann. Probab. (1978) 6(6):899–929CrossrefGoogle Scholar
  • Grötschel M., Holland O. Solution of large-scale symmetric travelling salesman problems. Math. Programming (1991) 51:141–202CrossrefGoogle Scholar
  • Guestrin C., Koller D., Parr R. Efficient solution algorithms for factored MDPs. J. Artificial Intelligence Res. (2003) 19:399–468CrossrefGoogle Scholar
  • Haussler D., Kearns M., Littlestone N., Warmuth M. K. Equivalence of models for polynomial learnability. Inform. Comput. (1991) 95(2):129–161CrossrefGoogle Scholar
  • Morrison J. R., Kumar P. R. New linear program performance bounds for queueing networks. J. Optim. Theory Appl. (1999) 100(3):575–597CrossrefGoogle Scholar
  • Schuurmans D., Patrascu R. Direct value-approximation for factored MDPs. Proc. 2001 Neural Inform. Processing Systems (NIPS) Conf., Adv. Neural Inform. Processing Systems (2002) 14(MIT Press, Cambridge, MA) Google Scholar
  • Schweitzer P., Seidmann A. Generalized polynomial approximations in Markovian decision processes. J. Math. Anal. Appl. (1985) 110:568–582CrossrefGoogle Scholar
  • Trick M., Zin S. A linear programming approach to solving stochastic dynamic programs. (1993) . Unpublished manuscriptGoogle Scholar
  • Trick M., Zin S. Spline approximations to value functions: A linear programming approach. Macroeconomic Dynam. (1997) 1:255–277CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.