{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:59:46Z","timestamp":1649145586616},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2018,6,6]],"date-time":"2018-06-06T00:00:00Z","timestamp":1528243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9,16]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>The extremum value theorem for function spaces plays the central role in optimal control. It is known that computation of optimal control actions and policies is often prone to numerical errors which may be related to computability issues. The current work addresses a version of the extremum value theorem for function spaces under explicit consideration of numerical uncertainties. It is shown that certain function spaces are bounded in a suitable sense, i.e., they admit finite approximations up to an arbitrary precision. The proof of this fact is constructive in the sense that it explicitly builds the approximating functions. Consequently, existence of approximate extremal functions is shown. Applicability of the theorem is investigated for finite-horizon optimal control, dynamic programming and adaptive dynamic programming. Some possible computability issues of the extremum value theorem in optimal control are shown on counterexamples.<\/jats:p>","DOI":"10.1093\/imamci\/dny018","type":"journal-article","created":{"date-parts":[[2018,5,16]],"date-time":"2018-05-16T11:09:33Z","timestamp":1526468973000},"page":"1015-1032","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of extremum value theorems for function spaces in optimal control under numerical uncertainty"],"prefix":"10.1093","volume":"36","author":[{"given":"P","family":"Osinenko","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Chemnitz, Automatic Control and System Dynamics Laboratory, Chemnitz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S","family":"Streif","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Chemnitz, Automatic Control and System Dynamics Laboratory, Chemnitz, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,6,6]]},"reference":[{"key":"2019091715381947400_C1","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1109\/TSMCB.2008.926614","article-title":"Discrete-time nonlinear HJB solution using approximate dynamic programming: convergence proof","volume":"38","author":"Al Tamimi","year":"2008","journal-title":"IEEE Trans. Syst. Man. Cybern. Part B (Cybernetics)"},{"key":"2019091715381947400_C2","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1109\/TSMCB.2008.926599","article-title":"Issues on stability of ADP feedback controllers for dynamical systems","volume":"38","author":"Balakrishnan","year":"2008","journal-title":"IEEE Trans. Syst. Man. Cybern. Part B (Cybernetics)"},{"key":"2019091715381947400_C3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0022-4049(96)00160-0","article-title":"A constructive proof of the Stone-Weierstrass theorem","volume":"116","author":"Banaschewski","year":"1997","journal-title":"J. Pure Appl. Algebra"},{"key":"2019091715381947400_C4","volume-title":"Topological Spaces: Including a Treatment of Multi-valued Functions, Vector Spaces, and Convexity","author":"Berge","year":"1963"},{"key":"2019091715381947400_C5","doi-asserted-by":"crossref","first-page":"713","DOI":"10.2178\/jsl\/1146620167","article-title":"The fan theorem and unique existence of maxima","volume":"71","author":"Berger","year":"2006","journal-title":"J. Symbolic Logic"},{"key":"2019091715381947400_C6","first-page":"560","article-title":"Neuro-dynamic programming: an overview","volume-title":"Proceedings of the 34th IEEE Conference on Decision and Control","author":"Bertsekas","year":"1995"},{"key":"2019091715381947400_C7","volume-title":"Foundations of Constructive Analysis","author":"Bishop","year":"1967"},{"key":"2019091715381947400_C8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61667-9","volume-title":"Constructive Analysis","author":"Bishop","year":"1985"},{"key":"2019091715381947400_C9","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1214\/aoms\/1177700285","article-title":"Discounted dynamic programming","volume":"36","author":"Blackwell","year":"1965","journal-title":"Ann. Math. Stat."},{"key":"2019091715381947400_C10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511565663","volume-title":"Varieties of Constructive Mathematics","author":"Bridges","year":"1987"},{"key":"2019091715381947400_C11","volume-title":"Techniques of Constructive Analysis. Universitext","author":"Bridges","year":"2007"},{"key":"2019091715381947400_C12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00153-006-0032-0","article-title":"Constructing local optima on a compact interval","volume":"46","author":"Bridges","year":"2007","journal-title":"Arch. Math. Logic"},{"key":"2019091715381947400_C13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s11768-011-1104-1","article-title":"Special issue on approximate dynamic programming and reinforcement learning","volume":"9","author":"Ferrari","year":"2011","journal-title":"J. Control Theory Appl."},{"key":"2019091715381947400_C14","doi-asserted-by":"crossref","first-page":"2733","DOI":"10.1109\/TCYB.2014.2314612","article-title":"Revisiting approximate dynamic programming and its convergence","volume":"44","author":"Heydari","year":"2014","journal-title":"IEEE Trans. Cybern."},{"key":"2019091715381947400_C15","volume-title":"Optimal Control","author":"Lewis","year":"1995"},{"key":"2019091715381947400_C16","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1109\/TNNLS.2013.2281663","article-title":"Policy iteration adaptive dynamic programming algorithm for discrete-time nonlinear systems","volume":"25","author":"Liu","year":"2014","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"2019091715381947400_C17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s11784-007-0041-6","article-title":"A simple proof of the Banach contraction principle","volume":"2","author":"Palais","year":"2007","journal-title":"J. Fixed Point Theory Appl."},{"key":"2019091715381947400_C18","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S096249291000005X","article-title":"Verification methods: rigorous results using floating-point arithmetic","volume":"19","author":"Rump","year":"2010","journal-title":"Acta Numerica"},{"key":"2019091715381947400_C19","volume-title":"Constructive Analysis With Witnesses","author":"Schwichtenberg","year":"2012"},{"key":"2019091715381947400_C20","volume-title":"Constructive Nonlinear Control","author":"Sepulchre","year":"2012"},{"key":"2019091715381947400_C21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0167-6911(89)90028-5","article-title":"A \u201cuniversal\u201d construction of artstein\u2019s theorem on nonlinear stabilization","volume":"13","author":"Sontag","year":"1989","journal-title":"Syst. Control Lett."},{"key":"2019091715381947400_C22","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"1998"},{"key":"2019091715381947400_C23","first-page":"173","article-title":"On the maximum theorem: a constructive analysis","volume":"6","author":"Tanaka","year":"2012","journal-title":"Int. J. Comp. and Math. Sciences"},{"key":"2019091715381947400_C24","first-page":"230","article-title":"On computable numbers, with an application to the entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proc. London Math. Soc."},{"key":"2019091715381947400_C25","first-page":"67","author":"Werbos","year":"1990","journal-title":"A menu of designs for reinforcement learning over time, Neural Networks for Control"},{"key":"2019091715381947400_C26","first-page":"493","volume-title":"Approximate dynamic programming for real-time control and neural modeling.Handb. Intelligent Cont.: Neural Fuzzy Adaptive Approaches","author":"Werbos","year":"1992"},{"key":"2019091715381947400_C27","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-007-1347-5","volume-title":"Strict Finitism and the Logic of Mathematical Applications","author":"Ye","year":"2011"}],"container-title":["IMA Journal of Mathematical Control and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/imamci\/article-pdf\/36\/3\/1015\/30002524\/dny018.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T19:39:36Z","timestamp":1568749176000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/imamci\/article\/36\/3\/1015\/5032998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,6]]},"references-count":27,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2018,6,6]]},"published-print":{"date-parts":[[2019,9,16]]}},"URL":"https:\/\/doi.org\/10.1093\/imamci\/dny018","relation":{},"ISSN":["0265-0754","1471-6887"],"issn-type":[{"value":"0265-0754","type":"print"},{"value":"1471-6887","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,9]]},"published":{"date-parts":[[2018,6,6]]}}}