{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:55:07Z","timestamp":1773413707804,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/tac.2013.2272973","type":"journal-article","created":{"date-parts":[[2013,7,10]],"date-time":"2013-07-10T18:03:02Z","timestamp":1373479382000},"page":"2995-3010","source":"Crossref","is-referenced-by-count":82,"title":["An Optimal Approximate Dynamic Programming Algorithm for Concave, Scalar Storage Problems With Vector-Valued Controls"],"prefix":"10.1109","volume":"58","author":[{"given":"Juliana","family":"Nascimento","sequence":"first","affiliation":[]},{"given":"Warren B.","family":"Powell","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","author":"vanderbei","year":"1996","journal-title":"Linear Programming Foundations and Extensions"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/0117061"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/9.580874"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF00993306"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.1989.118583"},{"key":"ref10","author":"bertsekas","year":"1996","journal-title":"Neuro-Dynamic Programming"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012997331639"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022641805263"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s12667-010-0011-8"},{"key":"ref14","first-page":"2079","article-title":"Value function approximation using multiple aggregation for multiattribute resource management","volume":"9","author":"george","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.47.8.1101.10231"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-009-0563-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.3.650"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1994.6.6.1185"},{"key":"ref19","first-page":"815","article-title":"Finite-time bounds for fitted value iteration","volume":"1","author":"munos","year":"2008","journal-title":"J Mach Learn Res"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2200\/S00268ED1V01Y201005AIM009"},{"key":"ref4","first-page":"81","article-title":"Learning to act using realtime dynamic programming","volume":"72","author":"barto","year":"1995","journal-title":"Artificial Intelligence Special Volume on Computational Research on Interaction and Agency"},{"key":"ref27","author":"sutton","year":"1998","journal-title":"Reinforcement Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5038-2"},{"key":"ref6","author":"bertsekas","year":"2005","journal-title":"Dynamic Programming and Stochastic Control Vol I"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0079"},{"key":"ref5","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref8","volume":"ii","author":"bertsekas","year":"2012","journal-title":"Approximate Dynamic Programming"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11768-011-1005-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ADPRL.2007.368207"},{"key":"ref9","first-page":"1","article-title":"Stochastic approximation for nonexpansive maps: Application to Q-learning algorithms","volume":"41","author":"bertsekas","year":"2003","journal-title":"SIAM J Control Optim"},{"key":"ref1","first-page":"71","volume":"91","author":"ahuja","year":"1993","journal-title":"Theory Algorithms and Applications"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0360"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0470"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1002\/9781118029176","author":"powell","year":"2011","journal-title":"Approximate Dynamic Programming Solving the Curses of Dimensionality"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/S0927-0507(03)10006-0","volume":"10","author":"shapiro","year":"2003","journal-title":"Handbooks in Operations Research and Management Science Stochastic Programming"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0107"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2539-1","volume":"95","author":"shiryaev","year":"1996","journal-title":"Graduate Texts in Mathematics"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/6670077\/06557011.pdf?arnumber=6557011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:36:48Z","timestamp":1638218208000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6557011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":34,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tac.2013.2272973","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}