{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T04:04:17Z","timestamp":1771992257253,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T00:00:00Z","timestamp":1721174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T00:00:00Z","timestamp":1721174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11801087"],"award-info":[{"award-number":["11801087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["12171100"],"award-info":[{"award-number":["12171100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s10107-024-02120-0","type":"journal-article","created":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T14:01:53Z","timestamp":1721224913000},"page":"635-682","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New notions of simultaneous diagonalizability of quadratic forms with applications to QCQPs"],"prefix":"10.1007","volume":"212","author":[{"given":"Alex L.","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6610-6778","authenticated-orcid":false,"given":"Rujun","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,17]]},"reference":[{"issue":"2","key":"2120_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2), 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"issue":"1","key":"2120_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87(1), 131\u2013152 (2000)","journal-title":"Math. Program."},{"key":"2120_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129 (2011)","journal-title":"Math. Program."},{"key":"2120_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0710-8","volume":"143","author":"A Ben-Tal","year":"2014","unstructured":"Ben-Tal, A., den Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143, 1\u201329 (2014)","journal-title":"Math. Program."},{"key":"2120_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02592331","volume":"72","author":"A Ben-Tal","year":"1996","unstructured":"Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72, 51\u201363 (1996)","journal-title":"Math. Program."},{"key":"2120_CR6","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Michalka, A.: Polynomial solvability of variants of the trust-region subproblem. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. pp 380\u2013390 (2014)","DOI":"10.1137\/1.9781611973402.28"},{"issue":"1","key":"2120_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-015-0921-2","volume":"158","author":"A Billionnet","year":"2016","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1), 235\u2013266 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"2120_CR8","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/22M1528215","volume":"34","author":"G Blekherman","year":"2024","unstructured":"Blekherman, G., Dey, S.S., Sun, S.: Aggregations of quadratic inequalities and hidden hyperplane convexity. SIAM J. Optim. 34(1), 98\u2013126 (2024)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"2120_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10589-005-1014-6","volume":"31","author":"S Braun","year":"2005","unstructured":"Braun, S., Mitchell, J.E.: A semidefinite programming heuristic for quadratic programming problems with complementarity constraints. Comp. Optim. Appl. 31(1), 5\u201329 (2005)","journal-title":"Comp. Optim. Appl."},{"key":"2120_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01367-2","volume":"181","author":"S Burer","year":"2019","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 181, 1\u201317 (2019)","journal-title":"Math. Program."},{"key":"2120_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"Samuel Burer","year":"2015","unstructured":"Burer, Samuel: A gentle, geometric introduction to copositive optimization. Math. Program. 151, 89\u2013116 (2015)","journal-title":"Math. Program."},{"issue":"4","key":"2120_CR12","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1137\/19M1280430","volume":"41","author":"MD Bustamante","year":"2020","unstructured":"Bustamante, M.D., Mellon, P., Velasco, M.V.: Solving the problem of simultaneous diagonalization of complex symmetric matrices via congruence. SIAM J. Matrix Anal. Appl. 41(4), 1616\u20131629 (2020)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2120_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s10107-016-1095-2","volume":"165","author":"C Chen","year":"2017","unstructured":"Chen, C., Atamt\u00fcrk, A., Oren, S.S.: A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables. Math. Program. 165(2), 549\u2013577 (2017)","journal-title":"Math. Program."},{"issue":"1","key":"2120_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"key":"2120_CR15","doi-asserted-by":"crossref","unstructured":"Eltved, A., Burer, S.: Strengthened SDP relaxation for an extended trust region subproblem with an application to optimal power flow. Math. Program. pp 1\u201326 (2022)","DOI":"10.1007\/s10107-021-01737-9"},{"issue":"2","key":"2120_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/050633500","volume":"49","author":"J Hiriart-Urruty","year":"2007","unstructured":"Hiriart-Urruty, J.: Potpourri of conjectures and open questions in nonlinear analysis and optimization. SIAM Rev. 49(2), 255\u2013273 (2007)","journal-title":"SIAM Rev."},{"issue":"3","key":"2120_CR17","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/16M1065197","volume":"27","author":"N Ho-Nguyen","year":"2017","unstructured":"Ho-Nguyen, N., K\u0131l\u0131n\u00e7-Karzan, F.: A second-order cone based approach for solving the trust-region subproblem and its variants. SIAM J. Optim. 27(3), 1485\u20131512 (2017)","journal-title":"SIAM J. Optim."},{"key":"2120_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411","volume-title":"Matrix Analysis","author":"RA Horn","year":"2012","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)"},{"key":"2120_CR19","unstructured":"Hsia, Y., Sheu, R.: Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. arXiv:1312.1398 (2013)"},{"issue":"20","key":"2120_CR20","doi-asserted-by":"publisher","first-page":"5297","DOI":"10.1109\/TSP.2016.2593681","volume":"64","author":"K Huang","year":"2016","unstructured":"Huang, K., Sidiropoulos, N.D.: Consensus-ADMM for general quadratically constrained quadratic programming. IEEE Trans. Signal Proces. 64(20), 5297\u20135310 (2016)","journal-title":"IEEE Trans. Signal Proces."},{"key":"2120_CR21","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"J Jeyakumar","year":"2014","unstructured":"Jeyakumar, J., Li, G.: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147, 171\u2013206 (2014)","journal-title":"Math. Program."},{"issue":"3","key":"2120_CR22","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1137\/15M1023920","volume":"26","author":"R Jiang","year":"2016","unstructured":"Jiang, R., Li, D.: Simultaneous diagonalization of matrices and its applications in quadratically constrained quadratic programming. SIAM J. Optim. 26(3), 1649\u20131668 (2016)","journal-title":"SIAM J. Optim."},{"key":"2120_CR23","volume-title":"Collected Works","author":"L Kronecker","year":"1968","unstructured":"Kronecker, L.: Collected Works. American Mathematical Society, Providence (1968)"},{"issue":"3","key":"2120_CR24","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/S003614450444556X","volume":"47","author":"P Lancaster","year":"2005","unstructured":"Lancaster, P., Rodman, L.: Canonical forms for Hermitian matrix pairs under strict equivalence and congruence. SIAM Rev. 47(3), 407\u2013443 (2005)","journal-title":"SIAM Rev."},{"issue":"2","key":"2120_CR25","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/21M1390657","volume":"43","author":"TH Le","year":"2022","unstructured":"Le, T.H., Nguyen, T.N.: Simultaneous diagonalization via congruence of Hermitian matrices: some equivalent conditions and a numerical solution. SIAM J. Matrix Anal. Appl. 43(2), 882\u2013911 (2022)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"2","key":"2120_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J Linderoth","year":"2005","unstructured":"Linderoth, J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103(2), 251\u2013282 (2005)","journal-title":"Math. Program."},{"issue":"6","key":"2120_CR27","first-page":"1141","volume":"10","author":"M Locatelli","year":"2016","unstructured":"Locatelli, M.: Exactness conditions for an SDP relaxation of the extended trust region problem. Oper. Res. Lett. 10(6), 1141\u20131151 (2016)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"2120_CR28","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-016-0436-2","volume":"67","author":"C Lu","year":"2017","unstructured":"Lu, C., Deng, Z., Jin, Q.: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. J. Glob. Optim. 67(3), 475\u2013493 (2017)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2120_CR29","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1111\/mafi.12383","volume":"34","author":"H Luo","year":"2024","unstructured":"Luo, H., Chen, Y., Zhang, X., Li, D., Wu, H.: Effective algorithms for optimal portfolio deleveraging problem with cross impact. Math. Finance 34(1), 36\u201389 (2024)","journal-title":"Math. Finance"},{"issue":"4","key":"2120_CR30","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1287\/opre.26.4.681","volume":"26","author":"Barry R Marks","year":"1978","unstructured":"Marks, Barry R., Wright, Gordon P.: A general inner approximation algorithm for nonconvex mathematical programs. Oper. Res. 26(4), 681\u2013683 (1978)","journal-title":"Oper. Res."},{"key":"2120_CR31","unstructured":"MOSEK ApS. The MOSEK optimization toolbox for MATLAB manual. Version 9.10., (2021). URL http:\/\/docs.mosek.com\/9.0\/toolbox\/index.html"},{"issue":"2","key":"2120_CR32","first-page":"387","volume":"80","author":"TS Motzkin","year":"1955","unstructured":"Motzkin, T.S., Taussky, O.: Pairs of matrices with property L. II. Trans. Amer. Math. Soc. 80(2), 387\u2013401 (1955)","journal-title":"Trans. Amer. Math. Soc."},{"key":"2120_CR33","unstructured":"Nguyen, T., Nguyen, V., Le, T., Sheu, R.: On simultaneous diagonalization via congruence of real symmetric matrices. arXiv preprint. arXiv:2004.06360 (2020)"},{"key":"2120_CR34","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.laa.2005.04.033","volume":"412","author":"K O\u2019meara","year":"2006","unstructured":"O\u2019meara, K., Vinsonhaler, C.: On approximately simultaneously diagonalizable matrices. Linear Algebra Appl. 412, 39\u201374 (2006)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"2120_CR35","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1023\/A:1021798932766","volume":"99","author":"BT Polyak","year":"1998","unstructured":"Polyak, B.T.: Convexity of quadratic transformations and its use in control and optimization. J. Optim. Theory Appl. 99(3), 553\u2013583 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"2120_CR36","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, Berlin (2013)"},{"key":"2120_CR37","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"NZ Shor","year":"1990","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and boolean programming. Ann. Oper. Res. 25, 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"key":"2120_CR38","volume-title":"Commutative Matrices","author":"DA Suprunenko","year":"1968","unstructured":"Suprunenko, D.A., Tyshkevich, R.I.: Commutative Matrices. Academic Press, Cambridge (1968)"},{"issue":"3","key":"2120_CR39","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0024-3795(76)90066-5","volume":"14","author":"F Uhlig","year":"1976","unstructured":"Uhlig, F.: A canonical form for a pair of real symmetric matrices that generate a nonsingular pencil. Linear Algebra Appl. 14(3), 189\u2013209 (1976)","journal-title":"Linear Algebra Appl."},{"issue":"9","key":"2120_CR40","doi-asserted-by":"publisher","first-page":"3270","DOI":"10.1109\/TSP.2006.877673","volume":"54","author":"R Vollgraf","year":"2006","unstructured":"Vollgraf, R., Obermayer, Klaus K.: Quadratic optimization for simultaneous matrix diagonalization. IEEE Trans. Signal Process. 54(9), 3270\u20133278 (2006)","journal-title":"IEEE Trans. Signal Process."},{"key":"2120_CR41","doi-asserted-by":"publisher","first-page":"107108","DOI":"10.1016\/j.orl.2024.107108","volume":"54","author":"AL Wang","year":"2024","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: On semidefinite descriptions for convex hulls of quadratic programs. Oper. Res. Lett. 54, 107108 (2024)","journal-title":"Oper. Res. Lett."},{"key":"2120_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01560-8","author":"AL Wang","year":"2020","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: The generalized trust region subproblem: solution complexity and convex hull results. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01560-8. (Forthcoming)","journal-title":"Math. Program."},{"key":"2120_CR43","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01589-9","author":"AL Wang","year":"2021","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: On the tightness of SDP relaxations of QCQPs. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-020-01589-9. (Forthcoming)","journal-title":"Math. Program."},{"key":"2120_CR44","first-page":"310","volume-title":"Zur Theorie der quadratischen und bilinearen Formen","author":"K Weierstrass","year":"1868","unstructured":"Weierstrass, K.: Zur Theorie der quadratischen und bilinearen Formen, pp. 310\u2013338. Monatsber. Akad. Wiss, Berlin (1868)"},{"issue":"1","key":"2120_CR45","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10589-023-00452-9","volume":"85","author":"Z Xu","year":"2023","unstructured":"Xu, Z., Zhou, J.: A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint. Comput. Optim. Appl. 85(1), 247\u2013261 (2023)","journal-title":"Comput. Optim. Appl."},{"issue":"7","key":"2120_CR46","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1007\/s11590-018-1337-8","volume":"13","author":"J Zhou","year":"2019","unstructured":"Zhou, J., Xu, Z.: A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints. Optim. Lett. 13(7), 1615\u20131630 (2019)","journal-title":"Optim. Lett."},{"key":"2120_CR47","first-page":"1","volume":"71","author":"J Zhou","year":"2020","unstructured":"Zhou, J., Chen, S., Yu, S., Tian, Y.: A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program. Optimization 71, 1\u201317 (2020)","journal-title":"Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02120-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02120-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02120-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:03:00Z","timestamp":1750176180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02120-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,17]]},"references-count":47,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["2120"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02120-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,17]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}