{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:53:32Z","timestamp":1762509212822,"version":"3.40.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004593","name":"Universidad Aut\u00f3noma de Madrid","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper we consider the numerical approximation of infinite horizon problems via the dynamic programming approach. The value function of the problem solves a Hamilton\u2013Jacobi\u2013Bellman equation that is approximated by a fully discrete method. It is known that the numerical problem is difficult to handle by the so called curse of dimensionality. To mitigate this issue we apply a reduction of the order by means of a new proper orthogonal decomposition (POD) method based on time derivatives. We carry out the error analysis of the method using recently proved optimal bounds for the fully discrete approximations. Moreover, the use of snapshots based on time derivatives allows us to bound some terms of the error that could not be bounded in a standard POD approach. Some numerical experiments show the good performance of the method in practice.\n<\/jats:p>","DOI":"10.1007\/s10915-025-02833-0","type":"journal-article","created":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T08:58:10Z","timestamp":1740819490000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Bounds for POD Approximations of Infinite Horizon Control Problems Based on Time Derivatives"],"prefix":"10.1007","volume":"103","author":[{"given":"Javier","family":"de Frutos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bosco","family":"Garc\u00eda-Archilla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6667-5666","authenticated-orcid":false,"given":"Julia","family":"Novo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,1]]},"reference":[{"key":"2833_CR1","doi-asserted-by":"crossref","first-page":"3091","DOI":"10.1137\/15M1039596","volume":"55","author":"A Alla","year":"2017","unstructured":"Alla, A., Falcone, M., Volkwein, S.: Error analysis for POD approximations of infinite horizon problems via the dynamic programming approach. SIAM J. Control. Optim. 55, 3091\u20133115 (2017)","journal-title":"SIAM J. Control. Optim."},{"key":"2833_CR2","doi-asserted-by":"crossref","first-page":"A2384","DOI":"10.1137\/18M1203900","volume":"41","author":"A Alla","year":"2019","unstructured":"Alla, A., Falcone, M., Saluzzi, L.: An efficient DP algorithm on a tree-structure for finite horizon optimal control problems. SIAM J. Sci. Comput. 41, A2384\u2013A2406 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"2833_CR3","doi-asserted-by":"crossref","unstructured":"Alla, A., Oliveira, H., Santin, G.: HJB-RBF based approach for the control of PDEs. J. Sci. Comput. 96, Paper 25, 27 pp (2023)","DOI":"10.1007\/s10915-023-02208-3"},{"key":"2833_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4755-1","volume-title":"Optimal Control and Viscosity Solutions of Hamilton\u2013Jacobi\u2013Belmann Equations","author":"M Bardi","year":"1997","unstructured":"Bardi, M., Capuzzo-Dolcetta, I.: Optimal Control and Viscosity Solutions of Hamilton\u2013Jacobi\u2013Belmann Equations. Springer, New York (1997)"},{"key":"2833_CR5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.camwa.2022.01.016","volume":"109","author":"O Bokanowski","year":"2022","unstructured":"Bokanowski, O., Gammoudi, N., Zidani, H.: Optimistic planning algorithms for state-constrained optimal control. Comput. Math. Appl. 109, 158\u2013179 (2022)","journal-title":"Comput. Math. Appl."},{"key":"2833_CR6","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s10915-012-9648-x","volume":"55","author":"O Bokanowski","year":"2013","unstructured":"Bokanowski, O., Garcke, J., Griebel, M., Klompmaker, M.: An adaptive sparse grid semi-Lagrangian scheme for first order Hamilton\u2013Jacobi\u2013Bellman equations. J. Sci. Comput. 55, 575\u2013605 (2013)","journal-title":"J. Sci. Comput."},{"key":"2833_CR7","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/21M1459290","volume":"61","author":"J de Frutos","year":"2023","unstructured":"de Frutos, J., Novo, J.: Optimal bounds for numerical approximations of infinite horizon problems based on dynamic programming approach. SIAM J. Control. Optim. 61, 415\u2013433 (2023)","journal-title":"SIAM J. Control. Optim."},{"key":"2833_CR8","doi-asserted-by":"crossref","first-page":"A2153","DOI":"10.1137\/22M1498401","volume":"45","author":"S Dolgov","year":"2023","unstructured":"Dolgov, S., Kalise, D., Saluzzi, L.: Data-driven tensor train gradient cross approximation for Hamilton\u2013Jacobi\u2013Bellman equations. SIAM J. Sci. Comput. 45, A2153\u2013A2184 (2023)","journal-title":"SIAM J. Sci. Comput."},{"key":"2833_CR9","doi-asserted-by":"crossref","first-page":"A1625","DOI":"10.1137\/19M1305136","volume":"43","author":"S Dolgov","year":"2021","unstructured":"Dolgov, S., Kalise, D., Kunisch, K.: Tensor decomposition methods for high-dimensional Hamilton\u2013Jacobi\u2013Bellman equations. SIAM J. Sci. Comput. 43, A1625\u2013A650 (2021)","journal-title":"SIAM J. Sci. Comput."},{"key":"2833_CR10","doi-asserted-by":"crossref","unstructured":"Eigel, M., Schneider, R., Sommer, D.: Dynamical low-rank approximations of solutions to the Hamilton\u2013Jacobi\u2013Bellman equation. Numer. Linear Algebra Appl. 30, Paper No. e2463, 20 pp (2023)","DOI":"10.1002\/nla.2463"},{"key":"2833_CR11","doi-asserted-by":"crossref","unstructured":"Eskew, S.L., Singler, J.R.: A new approach to proper orthogonal decomposition with difference quotients. Adv. Comput. Math. 49(2), Paper No. 13, 33 (2023)","DOI":"10.1007\/s10444-023-10011-9"},{"key":"2833_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01442644","volume":"15","author":"M Falcone","year":"1987","unstructured":"Falcone, M.: A numerical approach to the infinite horizon problem of deterministic control theory. Appl. Math. Optim. 15, 1\u201313 (1987)","journal-title":"Appl. Math. Optim."},{"key":"2833_CR13","unstructured":"Falcone, M.: Numerical solution of dynamic programming equations. In: Optimal Control and Viscosity Solutions of Hamilton\u2013Jacobi\u2013Bellman Equations, pp. 471\u2013504. Birkh\u00e4user Boston, Boston (1997)"},{"key":"2833_CR14","doi-asserted-by":"crossref","unstructured":"Falcone, M., Lacunara, P., Seghini.: A splitting algorithm for Hamilton\u2013Jacobi\u2013Bellman equations. Appl. Numer. Math. 15, 207\u2013218 (1994)","DOI":"10.1016\/0168-9274(94)00017-4"},{"key":"2833_CR15","doi-asserted-by":"crossref","first-page":"1340","DOI":"10.1137\/22M1503853","volume":"61","author":"B Garc\u00eda-Archilla","year":"2023","unstructured":"Garc\u00eda-Archilla, B., John, V., Novo, J.: POD-ROMs for incompressible flows including snapshots of the temporal derivative of the full order solution. SIAM J. Numer. Anal. 61, 1340\u20131368 (2023)","journal-title":"SIAM J. Numer. Anal."},{"key":"2833_CR16","unstructured":"Garc\u00eda-Archilla, B., John, V., Novo, J.: POD-ROM methods: from a finite set of snapshots to continuous-in-time approximations. SIAM J. Numer. Anal. (to appear)"},{"key":"2833_CR17","unstructured":"Garc\u00eda-Archilla, B., Novo, J.: Pointwise error bounds in POD methods without difference quotients. J. Sci.Comput. (to appear)"},{"key":"2833_CR18","doi-asserted-by":"crossref","first-page":"A1221","DOI":"10.1137\/130925141","volume":"36","author":"T Iliescu","year":"2014","unstructured":"Iliescu, T., Wang, Z.: Are the snapshot difference quotients needed in the proper orthogonal decomposition? SIAM J. Sci. Comput. 36, A1221\u2013A1250 (2014)","journal-title":"SIAM J. Sci. Comput."},{"key":"2833_CR19","doi-asserted-by":"crossref","first-page":"A629","DOI":"10.1137\/17M1116635","volume":"40","author":"D Kalise","year":"2018","unstructured":"Kalise, D., Kunisch, K.: Polynomial approximation of high-dimensional Hamilton\u2013Jacobi\u2013Bellman equations and applications to feedback control of semilinear parabolic PDEs. SIAM J. Sci. Comput. 40, A629\u2013A652 (2018)","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"2833_CR20","doi-asserted-by":"crossref","first-page":"2163","DOI":"10.1137\/20M1371798","volume":"59","author":"B Koc","year":"2021","unstructured":"Koc, B., Rubino, S., Schneier, M., Singler, J., Iliescu, T.: On optimal pointwise in time error bounds and difference quotients for the proper orthogonal decomposition. SIAM J. Numer. Anal. 59(4), 2163\u20132196 (2021)","journal-title":"SIAM J. Numer. Anal."},{"key":"2833_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s002110100282","volume":"90","author":"K Kunisch","year":"2001","unstructured":"Kunisch, K., Volkwein, S.: Galerkin proper orthogonal decomposition methods for parabolic problems. Numer. Math. 90, 117\u2013148 (2001)","journal-title":"Numer. Math."},{"key":"2833_CR22","doi-asserted-by":"crossref","first-page":"3281","DOI":"10.1016\/j.automatica.2014.10.056","volume":"50","author":"B Luo","year":"2014","unstructured":"Luo, B., Huai-Ning, W., Huang, T., Liu, D.: Data-based approximate policy iteration for affine nonlinear continuous-time optimal control design. Automatica 50, 3281\u20133290 (2014)","journal-title":"Automatica"},{"key":"2833_CR23","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1137\/040610830","volume":"46","author":"WM McEneaney","year":"2007","unstructured":"McEneaney, W.M.: A curse of dimensionality free numerical method for solution of certain HJB PDEs. SIAM J. Control. Optim. 46, 1239\u20131276 (2007)","journal-title":"SIAM J. Control. Optim."},{"key":"2833_CR24","doi-asserted-by":"crossref","first-page":"2651","DOI":"10.1137\/070687980","volume":"48","author":"WM McEneaney","year":"2009","unstructured":"McEneaney, W.M.: Convergence rate for a curse-of-dimensionality-free method for Hamilton\u2013Jacobi\u2013Bellman PDEs represented as maxima of quadratic forms. SIAM J. Control. Optim. 48, 2651\u20132685 (2009)","journal-title":"SIAM J. Control. Optim."},{"key":"2833_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1064827594276424","volume":"18","author":"LF Shampine","year":"1997","unstructured":"Shampine, L.F., Reichelt, M.W.: The Matlab ODE suite. SIAM J. Sci. Comput. 18, 1\u201322 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"2833_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-60771-9","volume-title":"Optimal Control: Novel Directions and Applications","author":"D Tonon","year":"2017","unstructured":"Tonon, D., Aronna, M.S., Kalise, D.: Optimal Control: Novel Directions and Applications, vol. 1. Springer, Cham (2017)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02833-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-025-02833-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-025-02833-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T00:47:29Z","timestamp":1743295649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-025-02833-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2833"],"URL":"https:\/\/doi.org\/10.1007\/s10915-025-02833-0","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"assertion":[{"value":"30 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"19"}}