{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T18:31:37Z","timestamp":1777314697578,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T00:00:00Z","timestamp":1612915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,10]],"date-time":"2021-02-10T00:00:00Z","timestamp":1612915200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10957-021-01825-y","type":"journal-article","created":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T08:47:56Z","timestamp":1613033276000},"page":"136-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Quadratic Maximization of Reachable Values of Affine Systems with Diagonalizable Matrix"],"prefix":"10.1007","volume":"189","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7443-3170","authenticated-orcid":false,"given":"Assal\u00e9","family":"Adj\u00e9","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,10]]},"reference":[{"key":"1825_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-54292-8_2","volume-title":"Numerical Software Verification","author":"A Adj\u00e9","year":"2017","unstructured":"Adj\u00e9, A.: Proving properties on PWA systems using copositive and semidefinite programming. In: Bogomolov, S., Martel, M., Prabhakar, P. (eds.) Numerical Software Verification, pp. 15\u201330. Springer, Cham (2017)"},{"key":"1825_CR2","doi-asserted-by":"crossref","unstructured":"Adj\u00e9, A., Garoche, P.L., Magron, V.: Property-based polynomial invariant generation using sums-of-squares optimization. In: International Symposium On Static Analysis (SAS), pp. 235\u2013251. Springer, New York (2015)","DOI":"10.1007\/978-3-662-48288-9_14"},{"key":"1825_CR3","doi-asserted-by":"publisher","unstructured":"Saberi, A., Stoorvogel, A., Sannuti, P.: H2 Optimal Control with an Output Regulation Constraint - Discrete-Time Systems, pp. 303\u2013315. Springer, London (2000). https:\/\/doi.org\/10.1007\/978-1-4471-0727-9_9","DOI":"10.1007\/978-1-4471-0727-9_9"},{"issue":"12","key":"1825_CR4","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1109\/TCYB.2014.2384016","volume":"45","author":"B Kiumarsi","year":"2015","unstructured":"Kiumarsi, B., Lewis, F.L., Naghibi-Sistani, M., Karimpour, A.: Optimal tracking control of unknown discrete-time linear systems using input-output measured data. IEEE Trans. Cybern. 45(12), 2770\u20132779 (2015)","journal-title":"IEEE Trans. Cybern."},{"issue":"8","key":"1825_CR5","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1002\/(SICI)1099-1239(19980715)8:8<649::AID-RNC334>3.0.CO;2-6","volume":"8","author":"IR Petersen","year":"1998","unstructured":"Petersen, I.R., McFarlane, D.C., Rotea, M.A.: Optimal guaranteed cost control of discrete-time uncertain linear systems. Int. J. Robust Nonlinear Control 8(8), 649\u2013657 (1998)","journal-title":"Int. J. Robust Nonlinear Control"},{"issue":"2","key":"1825_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1002\/(SICI)1099-1239(199603)6:2<85::AID-RNC137>3.0.CO;2-Z","volume":"6","author":"T Iwasaki","year":"1996","unstructured":"Iwasaki, T.: Robust performance analysis for systems with structured uncertainty. Int. J. Robust Nonlinear Control 6(2), 85\u201399 (1996)","journal-title":"Int. J. Robust Nonlinear Control"},{"key":"1825_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2019.108593","author":"H Zhang","year":"2019","unstructured":"Zhang, H., Umenberger, J., Hu, X.: Inverse optimal control for discrete-time finite-horizon linear quadratic regulators. Automatica (2019). https:\/\/doi.org\/10.1016\/j.automatica.2019.108593","journal-title":"Automatica"},{"key":"1825_CR8","doi-asserted-by":"publisher","unstructured":"Ahiyevichh, V., Parsegov, S., Shcherbakov, P.: Upper bounds on peaks in discrete-time linear systems. Automatic Remote Control (2018). https:\/\/doi.org\/10.31857\/S000523100002775-6","DOI":"10.31857\/S000523100002775-6"},{"issue":"4","key":"1825_CR9","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0167-6911(92)90064-Y","volume":"19","author":"V Balakrishnan","year":"1992","unstructured":"Balakrishnan, V., Boyd, S.: On computing the worst-case peak gain of linear systems. Syst. Control Lett. 19(4), 265\u2013269 (1992)","journal-title":"Syst. Control Lett."},{"issue":"5s","key":"1825_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3358229","volume":"18","author":"B Ghosh","year":"2019","unstructured":"Ghosh, B., Duggirala, P.S.: Robust reachable set: accounting for uncertainties in linear dynamical systems. ACM Trans. Embed. Comput. Syst. (TECS) 18(5s), 1\u201322 (2019)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"key":"1825_CR11","doi-asserted-by":"crossref","unstructured":"Kong, H., Bartocci, E., Henzinger, T.A.: Reachable Set Over-Approximation for Nonlinear Systems using Piecewise Barrier Tubes. In: International Conference on Computer Aided Verification, pp. 449\u2013467. Springer (2018)","DOI":"10.1007\/978-3-319-96145-3_24"},{"key":"1825_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50763-7","volume-title":"Formal Methods for Discrete-time Dynamical Systems","author":"C Belta","year":"2017","unstructured":"Belta, C., Yordanov, B., Gol, E.A.: Formal Methods for Discrete-time Dynamical Systems, vol. 89. Springer, New York (2017)"},{"key":"1825_CR13","volume-title":"Handbook of Semidefinite Programming: Theory, Algorithms, and Applications","author":"H Wolkowicz","year":"2012","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L.: Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, vol. 27. Springer, New York (2012)"},{"key":"1825_CR14","unstructured":"Adj\u00e9, A.: Optimal analysis of discrete-time affine systems (2018)"},{"key":"1825_CR15","doi-asserted-by":"publisher","unstructured":"Ahmadi, A.A., G\u00fcnl\u00fck, O.: Robust-to-dynamics linear programming. In: Proceedings of the 2015 54th IEEE Conference on Decision and Control (CDC), pp. 5915\u20135919 (2015). https:\/\/doi.org\/10.1109\/CDC.2015.7403149","DOI":"10.1109\/CDC.2015.7403149"},{"key":"1825_CR16","unstructured":"Ahmadi, A.A., G\u00fcnl\u00fck, O.: Robust-to-Dynamics Optimization. arXiv preprint arXiv:1805.03682 (2018)"},{"key":"1825_CR17","volume-title":"Switched Linear Systems: Control and Design","author":"Z Sun","year":"2006","unstructured":"Sun, Z.: Switched Linear Systems: Control and Design. Springer, New York (2006)"},{"key":"1825_CR18","doi-asserted-by":"crossref","unstructured":"Fijalkow, N., Ouaknine, J., Pouly, A., Sousa-Pinto, J., Worrell, J.: On the decidability of reachability in linear time-invariant systems. In: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (HSCC), pp. 77\u201386 (2019)","DOI":"10.1145\/3302504.3311796"},{"key":"1825_CR19","doi-asserted-by":"crossref","unstructured":"Ouaknine, J., Worrell, J.: On the positivity problem for simple linear recurrence sequences. In: International Colloquium on Automata, Languages, and Programming (ICALP), pp. 318\u2013329. Springer, New York (2014)","DOI":"10.1007\/978-3-662-43951-7_27"},{"key":"1825_CR20","volume-title":"Matrix Analysis","author":"RA Horn","year":"1990","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"2","key":"1825_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s12532-018-0147-4","volume":"11","author":"F Furini","year":"2019","unstructured":"Furini, F., Traversi, E., Belotti, P., Frangioni, A., Gleixner, A., Gould, N., Liberti, L., Lodi, A., Misener, R., Mittelmann, H., et al.: Qplib: a library of quadratic programming instances. Math. Program. Comput. 11(2), 237\u2013265 (2019)","journal-title":"Math. Program. Comput."},{"issue":"12","key":"1825_CR22","doi-asserted-by":"publisher","first-page":"1397","DOI":"10.1016\/0098-1354(90)80020-C","volume":"14","author":"C Floudas","year":"1990","unstructured":"Floudas, C., Visweswaran, V.: A global optimization algorithm (GOP) for certain classes of nonconvex NLPs\u2013I. Theory. Comput. Chem. Eng. 14(12), 1397\u20131417 (1990)","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1825_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259\u2013282 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"1825_CR24","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10589-006-8717-1","volume":"36","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Tits, A.L.: Newton-KKT interior-point methods for indefinite quadratic programming. Comput. Optim. Appl. 36(1), 5\u201341 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1825_CR25","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10589-017-9949-y","volume":"69","author":"W Huyer","year":"2018","unstructured":"Huyer, W., Neumaier, A.: MINQ8: general definite and bound constrained indefinite quadratic programming. Comput. Optim. Appl. 69(2), 351\u2013381 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"1825_CR26","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070050006","volume":"87","author":"S Zhang","year":"2000","unstructured":"Zhang, S.: Quadratic maximization and semidefinite relaxation. Math. Program. 87(3), 453\u2013465 (2000)","journal-title":"Math. Program."},{"issue":"2","key":"1825_CR27","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26(2), 143\u2013154 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"1825_CR28","doi-asserted-by":"crossref","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. pp. 1\u201317 (2019)","DOI":"10.1007\/s10107-019-01367-2"},{"issue":"1\u20134","key":"1825_CR29","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1080\/10556789908805759","volume":"11","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J.: LOQO: an interior-point code for quadratic programming. Optim. Methods Softw. 11(1\u20134), 451\u2013484 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1825_CR30","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12532-012-0035-2","volume":"4","author":"MP Friedlander","year":"2012","unstructured":"Friedlander, M.P., Orban, D.: A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1), 71\u2013107 (2012)","journal-title":"Math. Program. Comput."},{"key":"1825_CR31","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s10589-014-9710-8","volume":"61","author":"DG Tian","year":"2015","unstructured":"Tian, D.G.: An exterior point polynomial-time algorithm for convex quadratic programming. Comput. Optim. Appl. 61, 51\u201378 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"1825_CR32","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10589-014-9681-9","volume":"60","author":"FE Curtis","year":"2015","unstructured":"Curtis, F.E., Han, Z., Robinson, D.P.: A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization. Comput. Optim. Appl. 60(2), 311\u2013341 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"1825_CR33","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10107-015-0966-2","volume":"159","author":"A Forsgren","year":"2016","unstructured":"Forsgren, A., Gill, P.E., Wong, E.: Primal and dual active-set methods for convex quadratic programming. Math. Program. 159(1\u20132), 469\u2013508 (2016)","journal-title":"Math. Program."},{"key":"1825_CR34","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-31484-6_10","volume-title":"Nonconvex Quadratic Programming","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Nonconvex Quadratic Programming, pp. 337\u2013390. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31484-6_10"},{"issue":"1","key":"1825_CR35","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno, H.: Maximization of a convex quadratic function under linear constraints. Math. Program. 11(1), 117\u2013127 (1976)","journal-title":"Math. Program."},{"key":"1825_CR36","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-1-4615-2025-2_5","volume-title":"Quadratic Optimization","author":"C.A Floudas","year":"1995","unstructured":"Floudas, C..A., Visweswaran, V.: Quadratic Optimization, pp. 217\u2013269. Springer, Boston (1995). https:\/\/doi.org\/10.1007\/978-1-4615-2025-2_5"},{"issue":"1","key":"1825_CR37","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017). https:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev."},{"issue":"1","key":"1825_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01825-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-021-01825-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-021-01825-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,31]],"date-time":"2021-03-31T20:14:26Z","timestamp":1617221666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-021-01825-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,10]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1825"],"URL":"https:\/\/doi.org\/10.1007\/s10957-021-01825-y","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,10]]},"assertion":[{"value":"17 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}