{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:10:48Z","timestamp":1759666248896},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T00:00:00Z","timestamp":1463529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s11590-016-1040-6","type":"journal-article","created":{"date-parts":[[2016,5,18]],"date-time":"2016-05-18T12:50:23Z","timestamp":1463575823000},"page":"1613-1628","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Policy iteration for robust nonstationary Markov decision processes"],"prefix":"10.1007","volume":"10","author":[{"given":"Saumya","family":"Sinha","sequence":"first","affiliation":[]},{"given":"Archis","family":"Ghate","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,18]]},"reference":[{"key":"1040_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03004-2","volume-title":"Infinite-dimensional analysis: a hitchhiker\u2019s guide","author":"CD Aliprantis","year":"1994","unstructured":"Aliprantis, C.D., Border, K.C.: Infinite-dimensional analysis: a hitchhiker\u2019s guide. Springer-Verlag, Berlin (1994)"},{"key":"1040_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust optimization. Princeton University Press, Princeton (2009)"},{"issue":"1","key":"1040_CR3","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1287\/moor.1060.0224","volume":"32","author":"T Cheevaprawatdomrong","year":"2007","unstructured":"Cheevaprawatdomrong, T., Schochetman, I.E., Smith, R.L., Garcia, A.: Solution and forecast horizons for infinite-horizon non-homogeneous Markov decision processes. Math. Oper. Res. 32(1), 51\u201372 (2007)","journal-title":"Math. Oper. Res."},{"key":"1040_CR4","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1006\/jmaa.1999.6694","volume":"244","author":"A Garcia","year":"2000","unstructured":"Garcia, A., Smith, R.L.: Solving nonstationary infinite horizon dynamic optimization problems. J. Math. Anal. Appl. 244, 304\u2013317 (2000)","journal-title":"J. Math. Anal. Appl."},{"key":"1040_CR5","doi-asserted-by":"crossref","unstructured":"Ghate, A.: Infinite horizon problems. In: Cochran, J.J. (ed.) Wiley encyclopedia of operations research and management science. Wiley, Hoboken (2010)","DOI":"10.1002\/9780470400531.eorms0403"},{"issue":"4","key":"1040_CR6","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.1090.0755","volume":"58","author":"A Ghate","year":"2010","unstructured":"Ghate, A., Sharma, D., Smith, R.L.: A shadow simplex method for infinite linear programs. Oper. Res. 58(4), 865\u2013877 (2010)","journal-title":"Oper. Res."},{"issue":"2","key":"1040_CR7","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1287\/opre.1120.1121","volume":"61","author":"A Ghate","year":"2013","unstructured":"Ghate, A., Smith, R.L.: A linear programming approach to nonstationary infinite-horizon Markov decision processes. Oper. Res. 61(2), 413\u2013425 (2013)","journal-title":"Oper. Res."},{"key":"1040_CR8","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.35.6.875","volume":"35","author":"WJ Hopp","year":"1987","unstructured":"Hopp, W.J., Bean, J.C., Smith, R.L.: A new optimality criterion for non-homogeneous Markov decision processes. Oper. Res. 35, 875\u2013883 (1987)","journal-title":"Oper. Res."},{"key":"1040_CR9","unstructured":"Howard, R.A.: Dynamic programming and Markov processes. PhD thesis, MIT, Cambridge, MA, USA (1960)"},{"issue":"2","key":"1040_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.1040.0129","volume":"30","author":"GN Iyengar","year":"2005","unstructured":"Iyengar, G.N.: Robust dynamic programming. Math. Oper. Res. 30(2), 257\u2013280 (2005)","journal-title":"Math. Oper. Res."},{"key":"1040_CR11","unstructured":"Lee, I., Epelman, M.A., Romeijn, H.E., Smith, R.L.: Simplex algorithm for countable-state discounted Markov decision processes (2014). http:\/\/www.optimization-online.org\/DB_HTML\/2014\/11\/4645.html . Accessed Nov 2014"},{"issue":"5","key":"1040_CR12","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1287\/opre.1050.0216","volume":"53","author":"A Nilim","year":"2005","unstructured":"Nilim, A., El, L.: Ghaoui. Robust control of markov decision processes with uncertain transition matrices. Oper. Res. 53(5), 780\u2013798 (2005)","journal-title":"Oper. Res."},{"key":"1040_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov decision processes : discrete stochastic dynamic programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov decision processes : discrete stochastic dynamic programming. John Wiley and Sons, New York (1994)"},{"issue":"3","key":"1040_CR14","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1287\/moor.14.3.559","volume":"14","author":"IE Schochetman","year":"1989","unstructured":"Schochetman, I.E., Smith, R.L.: Infinite horizon optimization. Math. Oper. Res. 14(3), 559\u2013574 (1989)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"1040_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF01586057","volume":"54","author":"IE Schochetman","year":"1992","unstructured":"Schochetman, I.E., Smith, R.L.: Finite dimensional approximation in infinite dimensional mathematical programming. Math. Program. 54(3), 307\u2013333 (1992)","journal-title":"Math. Program."},{"issue":"4","key":"1040_CR16","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1287\/moor.1110.0516","volume":"36","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: The simplex and policy iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate. Math. Oper. Res. 36(4), 593\u2013603 (2011)","journal-title":"Math. Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1040-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1040-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1040-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1040-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,7]],"date-time":"2019-09-07T20:20:22Z","timestamp":1567887622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1040-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,18]]},"references-count":16,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["1040"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1040-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,18]]}}}