On constraint sampling in the linear programming approach to approximate linear programming
暂无分享,去创建一个
[1] R. Dudley. Central Limit Theorems for Empirical Measures , 1978 .
[2] P. Schweitzer,et al. Generalized polynomial approximations in Markovian decision processes , 1985 .
[3] David Haussler,et al. Equivalence of models for polynomial learnability , 1988, COLT '88.
[4] Martin Grötschel,et al. Solution of large-scale symmetric travelling salesman problems , 1991, Math. Program..
[5] Michael A. Trick,et al. A Linear Programming Approach to Solving Stochastic Dynamic Programming , 1993 .
[6] Kenneth L. Clarkson,et al. Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.
[7] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.
[8] Stanley E. Zin,et al. SPLINE APPROXIMATIONS TO VALUE FUNCTIONS: Linear Programming Approach , 1997 .
[9] R. Dudley,et al. Uniform Central Limit Theorems: Notation Index , 2014 .
[10] J. R. Morrison,et al. New Linear Program Performance Bounds for Queueing Networks , 1999 .
[11] Dale Schuurmans,et al. Direct value-approximation for factored MDPs , 2001, NIPS.
[12] Shobha Venkataraman,et al. Efficient Solution Algorithms for Factored MDPs , 2003, J. Artif. Intell. Res..
[13] Benjamin Van Roy,et al. The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..
[14] Giuseppe Carlo Calafiore,et al. Uncertain convex programs: randomized solutions and confidence levels , 2005, Math. Program..