{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T11:47:45Z","timestamp":1773920865067,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T00:00:00Z","timestamp":1443484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche (FR)","doi-asserted-by":"publisher","award":["ANR-13-INSE-0003"],"award-info":[{"award-number":["ANR-13-INSE-0003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11590-015-0951-y","type":"journal-article","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T03:38:45Z","timestamp":1443497925000},"page":"655-665","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximizing concave piecewise affine functions on the unitary group"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2777-9988","authenticated-orcid":false,"given":"St\u00e9phane","family":"Gaubert","sequence":"first","affiliation":[]},{"given":"Zheng","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Sridharan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,29]]},"reference":[{"key":"951_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03961-8","volume-title":"Infinite Dimensional Analysis. A Hitchhiker\u2019s Guide","author":"CD Aliprantis","year":"1999","unstructured":"Aliprantis, C.D., Border, K.C.: Infinite Dimensional Analysis. A Hitchhiker\u2019s Guide. Springer, Berlin (1999)"},{"key":"951_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. In: MPS\/SIAM Series on Optimization. Society for Industrial and Applied Mathematics (SIAM)\/Mathematical Programming Society (MPS), Philadelphia (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"951_CR3","doi-asserted-by":"crossref","unstructured":"Gaubert, S., McEneaney, W.M., Qu, Z.: Curse of dimensionality reduction in max-plus based approximation methods: theoretical estimates and improved pruning algorithms. In: Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC 11), pp. 1054\u20131061. IEEE (2011)","DOI":"10.1109\/CDC.2011.6161386"},{"key":"951_CR4","unstructured":"Gaubert, S., Qu, Z., Sridharan, S.: Bundle-based pruning in the max-plus curse of dimensionality free method. In: 21st International Symposium on Mathematical Theory of Networks and Systems, Groningen, The Netherlands (2014)"},{"issue":"4","key":"951_CR5","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(4), 1239\u20131276 (2007)","journal-title":"SIAM J. Control Optim."},{"key":"951_CR6","doi-asserted-by":"crossref","unstructured":"McEneaney, W.M.: Complexity reduction, cornices and pruning. In: Tropical and Idempotent Mathematics. Contemporary Mathematics, vol. 495, pp. 293\u2013303. American Mathematical Society, Providence (2009)","DOI":"10.1090\/conm\/495\/09702"},{"key":"951_CR7","doi-asserted-by":"crossref","unstructured":"McEneaney, W.M., Deshpande, A., Gaubert, S.: Curse-of-complexity attenuation in the curse-of-dimensionality-free method for HJB PDEs. In: Proceedings of the 2008 American Control Conference, pp. 4684\u20134690, Seattle, Washington, USA (2008)","DOI":"10.1109\/ACC.2008.4587234"},{"key":"951_CR8","doi-asserted-by":"crossref","unstructured":"McEneaney, W.M., Kluberg, L.J.: Convergence rate for a curse-of-dimensionality-free method for a class of HJB PDEs. SIAM J. Control Optim. 48(5), 3052\u20133079 (2009\/2010)","DOI":"10.1137\/070681934"},{"key":"951_CR9","first-page":"359375","volume":"52","author":"MVF Pereira","year":"1991","unstructured":"Pereira, M.V.F., Pinto, L.M.V.G.: Multi-stage stochastic optimization applied to energy planning. Math. Program. 52, 359375 (1991)","journal-title":"Math. Program."},{"issue":"5","key":"951_CR10","doi-asserted-by":"crossref","first-page":"2677","DOI":"10.1137\/130906702","volume":"52","author":"Z Qu","year":"2014","unstructured":"Qu, Z.: Contraction of Riccati flows applied to the convergence analysis of a max-plus curse-of-dimensionality-free method. SIAM J. Control Optim. 52(5), 2677\u20132706 (2014)","journal-title":"SIAM J. Control Optim."},{"key":"951_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998)"},{"key":"951_CR12","doi-asserted-by":"crossref","first-page":"042319","DOI":"10.1103\/PhysRevA.82.042319","volume":"82","author":"S Sridharan","year":"2010","unstructured":"Sridharan, S., Gu, M., James, M.R., McEneaney, W.M.: Reduced-complexity numerical method for optimal gate synthesis. Phys. Rev. A 82, 042319 (2010)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"951_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.ejor.2010.08.007","volume":"209","author":"A Shapiro","year":"2011","unstructured":"Shapiro, A.: Analysis of stochastic dual dynamic programming method. Eur. J. Oper. Res. 209(1), 63\u201372 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"951_CR14","doi-asserted-by":"crossref","unstructured":"Sridharan, S., McEneaney, W.M.: Deterministic filtering for optimal attitude estimation on SO(3) using max-plus methods. In: Proceedings of the European Control Conference ECC 2013, Zurich, pp. 2220\u20132225 (2013)","DOI":"10.23919\/ECC.2013.6669396"},{"issue":"3","key":"951_CR15","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00245-014-9247-3","volume":"70","author":"S Sridharan","year":"2014","unstructured":"Sridharan, S., McEneaney, W., Gu, M., James, M.R.: A reduced complexity min-plus solution method to the optimal control of closed quantum systems. Appl. Math. Optim. 70(3), 469\u2013510 (2014)","journal-title":"Appl. Math. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0951-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0951-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0951-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T22:34:09Z","timestamp":1567204449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0951-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,29]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["951"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0951-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,29]]}}}