{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T09:09:24Z","timestamp":1770455364410,"version":"3.49.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Fonds zur F\u00f6rderung der wissenschaftlichen Forschung","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2021,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we explore convex reformulation strategies for non-convex quadratically constrained optimization problems (QCQPs). First we investigate such reformulations using Pataki\u2019s rank theorem iteratively. We show that the result can be used in conjunction with conic optimization duality in order to obtain a geometric condition for the S-procedure to be exact. Based upon known results on the S-procedure, this approach allows for some insight into the geometry of the joint numerical range of the quadratic forms. Then we investigate a reformulation strategy introduced in recent literature for bilinear optimization problems which is based on adjustable robust optimization theory. We show that, via a similar strategy, one can leverage exact reformulation results of QCQPs in order to derive lower bounds for more complicated quadratic optimization problems. Finally, we investigate the use of reformulation strategies in order to derive characterizations of set-copositive matrix cones. Empirical evidence based upon first numerical experiments shows encouraging results.<\/jats:p>","DOI":"10.1007\/s00186-020-00726-6","type":"journal-article","created":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T00:02:37Z","timestamp":1602028957000},"page":"115-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Interplay of non-convex quadratically constrained problems with adjustable robust optimization"],"prefix":"10.1007","volume":"93","author":[{"given":"Immanuel","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9598-0106","authenticated-orcid":false,"given":"Markus","family":"Gabl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"issue":"1\u20132","key":"726_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"KM Anstreicher","year":"2010","unstructured":"Anstreicher KM, Burer S (2010) Computable representations for convex hulls of low-dimensional quadratic forms. Math Prog 124(1\u20132):33\u201343","journal-title":"Math Prog"},{"key":"726_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton"},{"issue":"2","key":"726_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Prog 99(2):351\u2013376","journal-title":"Math Prog"},{"issue":"2","key":"726_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I Bomze","year":"2002","unstructured":"Bomze I, D\u00fcr M, De Klerk E, Roos C, Quist A, Terlaky T (2002) On copositive programming and standard quadratic optimization problems. J Global Optim 24(2):163\u2013185","journal-title":"J Global Optim"},{"issue":"3","key":"726_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ejor.2011.04.026","volume":"216","author":"IM Bomze","year":"2012","unstructured":"Bomze IM (2012) Copositive optimization-recent developments and applications. Eur J Oper Res 216(3):509\u2013520","journal-title":"Eur J Oper Res"},{"issue":"3","key":"726_CR6","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1137\/140987997","volume":"25","author":"IM Bomze","year":"2015","unstructured":"Bomze IM (2015) Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems. SIAM J Optim 25(3):1249\u20131275","journal-title":"SIAM J Optim"},{"issue":"2","key":"726_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer S (2009) On the copositive representation of binary and continuous nonconvex quadratic programs. Math Prog 120(2):479\u2013495","journal-title":"Math Prog"},{"key":"726_CR8","doi-asserted-by":"crossref","unstructured":"Burer S (2012) Copositive programming. In: Handbook on semidefinite, conic and polynomial optimization, pp 201\u2013218. Springer","DOI":"10.1007\/978-1-4614-0769-0_8"},{"issue":"1","key":"726_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"S Burer","year":"2015","unstructured":"Burer S (2015) A gentle, geometric introduction to copositive optimization. Math Prog 151(1):89\u2013116","journal-title":"Math Prog"},{"issue":"1","key":"726_CR10","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/110826862","volume":"23","author":"S Burer","year":"2013","unstructured":"Burer S, Anstreicher KM (2013) Second-order-cone constraints for extended trust-region subproblems. SIAM J Optim 23(1):432\u2013451","journal-title":"SIAM J Optim"},{"issue":"3","key":"726_CR11","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer S, Dong H (2012) Representing quadratically constrained quadratic programs as generalized copositive programs. Oper Res Lett 40(3):203\u2013206","journal-title":"Oper Res Lett"},{"issue":"1\u20132","key":"726_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-014-0749-1","volume":"149","author":"S Burer","year":"2015","unstructured":"Burer S, Yang B (2015) The trust region subproblem with non-intersecting linear constraints. Math Prog 149(1\u20132):253\u2013264","journal-title":"Math Prog"},{"key":"726_CR13","unstructured":"Chieu N, Jeyakumar V, Li G (2019) Classes of nonnegative quadratic optimization problems with exact copositive relaxation. Available as arXiv preprint arXiv:1707.09486 (October\/30)"},{"issue":"6","key":"726_CR14","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1090\/S0002-9904-1941-07494-X","volume":"47","author":"LL Dines","year":"1941","unstructured":"Dines LL (1941) On the mapping of quadratic forms. Bull Am Math Soc 47(6):494\u2013498","journal-title":"Bull Am Math Soc"},{"key":"726_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-12598-0_1","volume-title":"Recent advances in optimization and its applications in engineering","author":"M D\u00fcr","year":"2010","unstructured":"D\u00fcr M (2010) Copositive programming\u2014a survey. In: Jarlebring E, Michiels W, Diehl M, Glineur F (eds) Recent advances in optimization and its applications in engineering. Springer, Berlin, pp 3\u201320"},{"issue":"6","key":"726_CR16","doi-asserted-by":"publisher","first-page":"1373","DOI":"10.1007\/s11590-012-0450-3","volume":"7","author":"G Eichfelder","year":"2013","unstructured":"Eichfelder G, Povh J (2013) On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim Lett 7(6):1373\u20131386","journal-title":"Optim Lett"},{"issue":"1","key":"726_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10288-006-0011-7","volume":"5","author":"A Faye","year":"2007","unstructured":"Faye A, Roupin F (2007) Partial lagrangian relaxation for general quadratic programming. 4OR 5(1):75\u201388","journal-title":"4OR"},{"key":"726_CR18","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.omega.2014.12.006","volume":"53","author":"BL Gorissen","year":"2015","unstructured":"Gorissen BL, Yanikoglu I, den Hertog D (2015) A practical guide to robust optimization. Omega 53:124\u2013137","journal-title":"Omega"},{"issue":"4","key":"726_CR19","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/090750391","volume":"52","author":"J-B Hiriart-Urruty","year":"2010","unstructured":"Hiriart-Urruty J-B, Seeger A (2010) A variational approach to copositive matrices. SIAM Rev 52(4):593\u2013629","journal-title":"SIAM Rev"},{"issue":"1\u20132","key":"726_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar V, Li G (2014) Trust-region problems with linear inequality constraints: exact sdp relaxation, global optimality and robust optimization. Math Prog 147(1\u20132):171\u2013206","journal-title":"Math Prog"},{"issue":"2","key":"726_CR21","first-page":"201","volume":"32","author":"A Mittal","year":"2019","unstructured":"Mittal A, Gokalp C, Hanasusanto GA (2019) Robust quadratic programming with mixed-integer uncertainty. INFORMS J Comput 32(2):201\u2013218","journal-title":"INFORMS J Comput"},{"key":"726_CR22","first-page":"1818","volume":"11\u201322","author":"T Motzkin","year":"1952","unstructured":"Motzkin T (1952) Copositive quadratic forms. Natl Bureau Standards Rep 11\u201322:1818","journal-title":"Natl Bureau Standards Rep"},{"issue":"2","key":"726_CR23","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/moor.23.2.339","volume":"23","author":"G Pataki","year":"1998","unstructured":"Pataki G (1998) On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math Oper Res 23(2):177\u2013203","journal-title":"Math Oper Res"},{"key":"726_CR24","unstructured":"Pataki G (2018) On positive duality gaps in semidefinite programming. Available as arXiv:1812.11796 (2019\/October\/30)"},{"issue":"3","key":"726_CR25","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I P\u00f3lik","year":"2007","unstructured":"P\u00f3lik I, Terlaky T (2007) A survey of the S-Lemma. SIAM Rev 49(3):371\u2013418","journal-title":"SIAM Rev"},{"issue":"3","key":"726_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1023\/A:1021798932766","volume":"99","author":"B Polyak","year":"1998","unstructured":"Polyak B (1998) Convexity of quadratic transformations and its use in control and optimization. J Optim Theory Appl 99(3):553\u2013583","journal-title":"J Optim Theory Appl"},{"key":"726_CR27","volume-title":"Convex analysis","author":"RT Rockafellar","year":"2015","unstructured":"Rockafellar RT (2015) Convex analysis. Princeton University Press, Princeton"},{"issue":"6","key":"726_CR28","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor NZ (1987) Quadratic optimization problems. Soviet J Comput Syst Sci 25(6):1\u201311","journal-title":"Soviet J Comput Syst Sci"},{"issue":"2","key":"726_CR29","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"JF Sturm","year":"2003","unstructured":"Sturm JF, Zhang S (2003) On cones of nonnegative quadratic functions. Math Oper Res 28(2):246\u2013267","journal-title":"Math Oper Res"},{"issue":"4","key":"726_CR30","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0167-6377(01)00093-1","volume":"29","author":"L Tun\u00e7el","year":"2001","unstructured":"Tun\u00e7el L (2001) On the slater condition for the sdp relaxations of nonconvex sets. Oper Res Lett 29(4):181\u2013186","journal-title":"Oper Res Lett"},{"issue":"1","key":"726_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10589-017-9974-x","volume":"70","author":"G Xu","year":"2018","unstructured":"Xu G, Burer S (2018) A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides. Comput Optim Appl 70(1):33\u201359","journal-title":"Comput Optim Appl"},{"key":"726_CR32","unstructured":"Xu G, Hanasusanto GA (2019) Improved decision rule approximations for multi-stage robust optimization via copositive programming. Available at http:\/\/www.optimization-online.org\/DB_FILE\/2018\/08\/6776.pdf (October\/30)"},{"key":"726_CR33","first-page":"62","volume":"1","author":"VA Yakubovich","year":"1971","unstructured":"Yakubovich VA (1971) S-procedure in nonlinear control theory. Vestnik Leningrad Univ 1:62\u201377","journal-title":"Vestnik Leningrad Univ"},{"issue":"2","key":"726_CR34","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10107-017-1157-0","volume":"170","author":"B Yang","year":"2016","unstructured":"Yang B, Anstreicher K, Burer S (2016) Quadratic programs with hollows. Math Prog 170(2):541\u2013553","journal-title":"Math Prog"},{"issue":"3","key":"726_CR35","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"I Yanikoglu","year":"2019","unstructured":"Yanikoglu I, Gorissen B, den Hertog D (2019) A survey of adjustable robust optimization. Eur J Oper Res 277(3):799\u2013813","journal-title":"Eur J Oper Res"},{"key":"726_CR36","unstructured":"Zhen J, Marandi A, den Hertog D, Vandenberghe L (2019) Disjoint bilinear programming: An adjustable robust optimization perspective. Available at http:\/\/www.optimization-online.org\/DB_HTML\/2018\/06\/6685.html (October\/30)"},{"issue":"4","key":"726_CR37","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.1137\/03060151X","volume":"16","author":"LF Zuluaga","year":"2006","unstructured":"Zuluaga LF, Vera J, Pe\u00f1a J (2006) LMI approximations for cones of positive semidefinite forms. SIAM J Optim 16(4):1076\u20131091","journal-title":"SIAM J Optim"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00726-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-020-00726-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-020-00726-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T05:19:20Z","timestamp":1633497560000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-020-00726-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["726"],"URL":"https:\/\/doi.org\/10.1007\/s00186-020-00726-6","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"21 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}