{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:43:40Z","timestamp":1787341420940,"version":"build-2736575974"},"reference-count":48,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We consider linear programming (LP) problems in infinite dimensional spaces that are in general computationally intractable. Under suitable assumptions, we develop an approximation bridge from the infinite dimensional LP to tractable finite convex programs in which the performance of the approximation is quantified explicitly. To this end, we adopt the recent developments in two areas of randomized optimization and first-order methods, leading to a priori as well as a posteriori performance guarantees. We illustrate the generality and implications of our theoretical results in the special case of the long-run average cost and discounted cost optimal control problems in the context of Markov decision processes on Borel spaces. The applicability of the theoretical results is demonstrated through a fisheries management problem.<\/jats:p>","DOI":"10.1137\/17m1133087","type":"journal-article","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T10:43:48Z","timestamp":1530614628000},"page":"1968-1998","source":"Crossref","is-referenced-by-count":29,"title":["From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming"],"prefix":"10.1137","volume":"28","author":[{"given":"Peyman","family":"Mohajerin Esfahani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tobias","family":"Sutter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Kuhn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Lygeros","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,7,3]]},"reference":[{"key":"atypb1","unstructured":"E. J. Anderson and P. Nash,\n                      Linear Programming in Infinite-Dimensional Spaces\n                      , John Wiley & Sons, Chichester, UK, 1987."},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/0331018"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/060667049"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal, L. Ghaoui, and A. Nemirovski,\n                      Robust Optimization\n                      , Princeton University Press, Princeton, NJ, 2009.","DOI":"10.1515\/9781400831050"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1975.1100984"},{"key":"atypb6","unstructured":"D. P. Bertsekas,\n                      Dynamic Programming and Optimal Control\n                      , Vol. II, 4th ed., Athena Scientific, Belmont, MA, 2012."},{"key":"atypb7","unstructured":"D. P. Bertsekas and S. E. Shreve,\n                      Stochastic Optimal Control\n                      , Academic Press, New York, 1978."},{"key":"atypb8","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis,\n                      Neuro-Dynamic Programming\n                      , Athena Scientific, Belmont, MA, 1996."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.07.002"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/07069821X"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2014.11.036"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176996454"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1287\/opre.51.6.850.24925"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0094"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0677-5"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2011.11.015"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/120867925"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2013.12.016"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1080\/17442508.2014.939979"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/0128064"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"A. Ern and J.L. Guermond,\n                      Theory and Practice of Finite Elements\n                      , Springer, New York, 2004.","DOI":"10.1007\/978-1-4757-4355-5"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"O. Herna\u0301ndez-Lerma,\n                      Adaptive Markov Control Processes\n                      , Appl. Math. Sci. 79, Springer, New York, 1989.","DOI":"10.1007\/978-1-4419-8714-3"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012999361627"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"O. Herna\u0301ndez-Lerma and J. Lasserre,\n                      Discrete-Time Markov Control Processes: Basic Optimality Criteria\n                      , Springer, New York, 1996.","DOI":"10.1007\/978-1-4612-0729-0"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497315768"},{"key":"atypb27","doi-asserted-by":"crossref","unstructured":"O. Herna\u0301ndez-Lerma and J. Lasserre,\n                      Further Topics on Discrete-Time Markov Control Processes\n                      , Springer, New York, 1999.","DOI":"10.1007\/978-1-4612-0561-6"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012901385691"},{"key":"atypb29","unstructured":"H. Kushner and G. G. Yin,\n                      Stochastic Approximation and Recursive Algorithms and Applications\n                      , Stoch. Model. Appl. Probab. 35, Springer, New York, 2003."},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586043"},{"key":"atypb31","doi-asserted-by":"crossref","unstructured":"J. B. Lasserre,\n                      Moments, Positive Polynomials and Their Applications\n                      , Imperial College Press, London, 2009.","DOI":"10.1142\/p665"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2500638"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2016.03.016"},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"P. Mohajerin Esfahani, T. Sutter, D. Kuhn, and J. Lygeros,\n                      From Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic Programming\n                      ,arXiv:1701.06379, 2017.","DOI":"10.1137\/17M1133087"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2330702"},{"key":"atypb36","first-page":"3","author":"Nemirovski A.","year":"2006","journal-title":"New York"},{"key":"atypb37","doi-asserted-by":"crossref","unstructured":"Y. Nesterov,\n                      Introductory Lectures on Convex Optimization: A Basic Course\n                      , Springer, New York, 2004.","DOI":"10.1007\/978-1-4419-8853-9"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0552-5"},{"key":"atypb39","first-page":"111","author":"Olsen P.","year":"1976","journal-title":"New York"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1137\/0314035"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-09-02204-2"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0393-3"},{"key":"atypb43","doi-asserted-by":"crossref","unstructured":"N. Saldi, S. Yu\u0308ksel, and T. Linder,\n                      Asymptotic Optimality of Finite Approximations to Markov Decision Processes with General State and Action Spaces\n                      , arXiv:1503.02244, 2015.","DOI":"10.1109\/ACC.2015.7171887"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1137\/15M1008476"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1958.8.171"},{"key":"atypb46","doi-asserted-by":"crossref","unstructured":"T. Sutter, P. Mohajerin Esfahani, and J. Lygeros,\n                      Approximation of constrained average cost Markov control processes\n                      , in Proceedings of the 53rd IEEE Conference on Decision and Control, 2014, pp. 6597-6602.","DOI":"10.1109\/CDC.2014.7040424"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1109\/9.580874"},{"key":"atypb48","doi-asserted-by":"crossref","unstructured":"C. Villani,\n                      Topics in Optimal Transportation\n                      , AMS, Providence, RI, 2003.","DOI":"10.1090\/gsm\/058"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1133087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:18:39Z","timestamp":1787339919000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1133087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1133087"],"URL":"https:\/\/doi.org\/10.1137\/17m1133087","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}