{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T14:15:13Z","timestamp":1779891313759,"version":"3.53.1"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T00:00:00Z","timestamp":1592697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T00:00:00Z","timestamp":1592697600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["YIP Award"],"award-info":[{"award-number":["YIP Award"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014043","name":"Office of the Under Secretary of Defense","doi-asserted-by":"publisher","award":["FA9550-10-1-0168"],"award-info":[{"award-number":["FA9550-10-1-0168"]}],"id":[{"id":"10.13039\/100014043","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation","award":["1807260"],"award-info":[{"award-number":["1807260"]}]},{"DOI":"10.13039\/100006133","name":"ARPA-E","doi-asserted-by":"crossref","award":["260801540061"],"award-info":[{"award-number":["260801540061"]}],"id":[{"id":"10.13039\/100006133","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["12951270"],"award-info":[{"award-number":["12951270"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10898-020-00918-8","type":"journal-article","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T05:02:37Z","timestamp":1592715757000},"page":"423-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Penalized semidefinite programming for quadratically-constrained quadratic optimization"],"prefix":"10.1007","volume":"78","author":[{"given":"Ramtin","family":"Madani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohsen","family":"Kheirandishfard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Javad","family":"Lavaei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1220-808X","authenticated-orcid":false,"given":"Alper","family":"Atamt\u00fcrk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,21]]},"reference":[{"issue":"2","key":"918_CR1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/18M118935X","volume":"3","author":"AA Ahmadi","year":"2019","unstructured":"Ahmadi, A.A., Majumdar, A.: DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization. SIAM J. Appl. Algebr. Geom. 3(2), 193\u2013230 (2019)","journal-title":"SIAM J. Appl. Algebr. Geom."},{"key":"918_CR2","doi-asserted-by":"crossref","unstructured":"Aittomaki, T., Koivunen, V.: Beam pattern optimization by minimization of quartic polynomial. In: 2009 IEEE\/SP 15th Workshop on Statistical Signal Processing, pp. 437\u2013440. IEEE (2009)","DOI":"10.1109\/SSP.2009.5278546"},{"issue":"1","key":"918_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95(1), 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"918_CR4","unstructured":"ApS M: The MOSEK optimization toolbox for MATLAB manual. Version 8.1. http:\/\/docs.mosek.com\/8.1\/toolbox\/index.html (2017)"},{"key":"918_CR5","doi-asserted-by":"crossref","unstructured":"Ashraphijuo, M., Madani, R., Lavaei, J.: Characterization of rank-constrained feasibility problems via a finite number of convex programs. In: 2016 IEEE 55th Conference on Decision and Control (CDC), pp. 6544\u20136550. IEEE(2016)","DOI":"10.1109\/CDC.2016.7799276"},{"key":"918_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-72792-7_2","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Atamt\u00fcrk","year":"2007","unstructured":"Atamt\u00fcrk, A., Narayanan, V.: Cuts for conic mixed-integer programming. In: Fischetti, M., Williamson, D.P. (eds.) Integer Programming and Combinatorial Optimization, pp. 16\u201329. Springer, Heidelberg (2007)"},{"issue":"22","key":"918_CR7","doi-asserted-by":"crossref","first-page":"5603","DOI":"10.1109\/TSP.2013.2273885","volume":"61","author":"A Aubry","year":"2013","unstructured":"Aubry, A., De Maio, A., Jiang, B., Zhang, S.: Ambiguity function shaping for cognitive radar via complex quartic optimization. IEEE Trans. Signal Process. 61(22), 5603\u20135619 (2013)","journal-title":"IEEE Trans. Signal Process."},{"key":"918_CR8","unstructured":"Bandeira, A.S., Boumal, N., Singer, A.: Tightness of the maximum likelihood semidefinite relaxation for angular synchronization. arXiv preprint arXiv:1411.3272 (2014)"},{"key":"918_CR9","doi-asserted-by":"crossref","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\u2013157 (2011)","journal-title":"Math. Program."},{"key":"918_CR10","volume-title":"COUENNE: A user\u2019s manual","author":"P Belotti","year":"2013","unstructured":"Belotti, P.: COUENNE: A user\u2019s manual. Technical report, Lehigh University, Tech. rep. (2013)"},{"issue":"2","key":"918_CR11","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1137\/15M1054079","volume":"28","author":"D Bienstock","year":"2018","unstructured":"Bienstock, D., Munoz, G.: LP formulations for polynomial optimization problems. SIAM J. Optim. 28(2), 1121\u20131150 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"918_CR12","doi-asserted-by":"crossref","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."},{"key":"918_CR13","doi-asserted-by":"crossref","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. arXiv preprint arXiv:1802.02688 (2018)","DOI":"10.1007\/s10107-019-01367-2"},{"key":"918_CR14","unstructured":"Burgdorf, S., Laurent, M., Piovesan, T.: On the closure of the completely positive semidefinite cone and linear approximations to quantum colorings. arXiv preprint arXiv:1502.02842 (2015)"},{"issue":"6","key":"918_CR15","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"issue":"8","key":"918_CR16","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1002\/cpa.21432","volume":"66","author":"EJ Candes","year":"2013","unstructured":"Candes, E.J., Strohmer, T., Voroninski, V.: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming. Commun. Pure Appl. Math. 66(8), 1241\u20131274 (2013)","journal-title":"Commun. Pure Appl. Math."},{"issue":"2","key":"918_CR17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/151005099","volume":"57","author":"EJ Candes","year":"2015","unstructured":"Candes, E.J., Eldar, Y.C., Strohmer, T., Voroninski, V.: Phase retrieval via matrix completion. SIAM Rev. 57(2), 225\u2013251 (2015)","journal-title":"SIAM Rev."},{"issue":"2","key":"918_CR18","doi-asserted-by":"crossref","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":"9","key":"918_CR19","doi-asserted-by":"crossref","first-page":"3533","DOI":"10.1109\/TSP.2009.2021632","volume":"57","author":"CY Chen","year":"2009","unstructured":"Chen, C.Y., Vaidyanathan, P.: Mimo radar waveform optimization with prior information of the extended target and clutter. IEEE Trans. Signal Process. 57(9), 3533\u20133544 (2009)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"918_CR20","doi-asserted-by":"crossref","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":"918_CR21","unstructured":"Cid, C., Murphy, S., Robshaw, M.: Computational and algebraic aspects of the advanced encryption standard. In: Proceedings of the Seventh International Workshop on Computer Algebra in Scientific Computing-CASC, vol. 2004 (2004)"},{"key":"918_CR22","doi-asserted-by":"crossref","unstructured":"Cid, C., Murphy, S., Robshaw, M.J. (2005) Small scale variants of the AES. In: International Workshop on Fast Software Encryption, pp. 145\u2013162. Springer","DOI":"10.1007\/11502760_10"},{"key":"918_CR23","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Pieprzyk, J.: Cryptanalysis of block ciphers with overdefined systems of equations. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 267\u2013287. Springer (2002)","DOI":"10.1007\/3-540-36178-2_17"},{"issue":"2","key":"918_CR24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0377-0427(94)90021-3","volume":"55","author":"M Deza","year":"1994","unstructured":"Deza, M., Laurent, M.: Applications of cut polyhedra\u2013ii. J. Comput. Appl. Math. 55(2), 217\u2013247 (1994)","journal-title":"J. Comput. Appl. Math."},{"key":"918_CR25","doi-asserted-by":"crossref","unstructured":"Fattahi, S., Sojoudi, S.: Data-driven sparse system identification. In: 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton). IEEE (2018)","DOI":"10.1109\/ALLERTON.2018.8635921"},{"issue":"1","key":"918_CR26","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/TAC.2018.2829473","volume":"64","author":"S Fattahi","year":"2018","unstructured":"Fattahi, S., Fazelnia, G., Lavaei, J., Arcak, M.: Transformation of optimal centralized controllers into near-globally optimal static distributed controllers. IEEE Trans. Autom. Control 64(1), 66\u201380 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"918_CR27","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/TAC.2016.2562062","volume":"62","author":"G Fazelnia","year":"2017","unstructured":"Fazelnia, G., Madani, R., Kalbat, A., Lavaei, J.: Convex relaxation for optimal distributed control problems. IEEE Trans. Autom. Control 62(1), 206\u2013221 (2017)","journal-title":"IEEE Trans. Autom. Control"},{"key":"918_CR28","unstructured":"Fogel, F., Waldspurger, I., dAspremont, A.: Phase retrieval for imaging problems. In: Mathematical Programming Computation, pp. 1\u201325 (2013)"},{"key":"918_CR29","doi-asserted-by":"crossref","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., Sahinidis, N., Vigerske, S., Wiegele, A.: QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11, 237\u2013310 (2019)","journal-title":"Math. Program. Comput."},{"key":"918_CR30","unstructured":"GAMS Development Corporation: General Algebraic Modeling System (GAMS) Release 24.2.1. Washington, DC, USA, http:\/\/www.gams.com\/ (2013)"},{"issue":"3","key":"918_CR31","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/MSP.2010.936015","volume":"27","author":"AB Gershman","year":"2010","unstructured":"Gershman, A.B., Sidiropoulos, N.D., Shahbazpanahi, S., Bengtsson, M., Ottersten, B.: Convex optimization-based beamforming: from receive to transmit and network designs. IEEE Signal Process. Mag. 27(3), 62\u201375 (2010)","journal-title":"IEEE Signal Process. Mag."},{"issue":"6","key":"918_CR32","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"key":"918_CR33","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/070679041","volume":"19","author":"S He","year":"2008","unstructured":"He, S., Luo, Z., Nie, J., Zhang, S.: Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization. SIAM J. Optim. 19, 503\u2013523 (2008)","journal-title":"SIAM J. Optim."},{"key":"918_CR34","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/s10107-010-0409-z","volume":"125","author":"S He","year":"2010","unstructured":"He, S., Li, Z., Zhang, S.: Approximation algorithms for homogeneous polynomial optimization with quadratic constraints. Math. Program. 125, 353\u2013383 (2010)","journal-title":"Math. Program."},{"issue":"7","key":"918_CR35","doi-asserted-by":"crossref","first-page":"072102","DOI":"10.1063\/1.3451264","volume":"51","author":"JJ Hilling","year":"2010","unstructured":"Hilling, J.J., Sudbery, A.: The geometric measure of multipartite entanglement and the singular values of a hypermatrix. J. Math. Phys. 51(7), 072102 (2010)","journal-title":"J. Math. Phys."},{"key":"918_CR36","doi-asserted-by":"crossref","unstructured":"Ibaraki, S., Tomizuka, M.: Rank minimization approach for solving BMI problems with random search. In: Proceedings of the 2001 American Control Conference. (Cat. No. 01CH37148), vol. 3, pp. 1870\u20131875. IEEE (2001)","DOI":"10.1109\/ACC.2001.946009"},{"issue":"2","key":"918_CR37","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1137\/15M1034386","volume":"28","author":"C Josz","year":"2018","unstructured":"Josz, C., Molzahn, D.K.: Lasserre hierarchy for large scale polynomial optimization in real and complex variables. SIAM J. Optim. 28(2), 1017\u20131048 (2018)","journal-title":"SIAM J. Optim."},{"key":"918_CR38","doi-asserted-by":"crossref","unstructured":"Kheirandishfard, M., Zohrizadeh, F., Adil, M., Madani, R. (2018a). Convex relaxation of bilinear matrix inequalities part II: applications to optimal control synthesis. In: IEEE 57th Annual Conference on Decision and Control (CDC)","DOI":"10.1109\/CDC.2018.8619567"},{"key":"918_CR39","doi-asserted-by":"crossref","unstructured":"Kheirandishfard, M., Zohrizadeh, F., Adil, M., Madani, R.: Convex relaxation of bilinear matrix inequalities part ii: applications to optimal control synthesis. In: 2018 IEEE Conference on Decision and Control (CDC), pp. 75\u201382. IEEE (2018b)","DOI":"10.1109\/CDC.2018.8619567"},{"key":"918_CR40","doi-asserted-by":"crossref","unstructured":"Kheirandishfard, M., Zohrizadeh, F., Madani, R.: Convex relaxation of bilinear matrix inequalities part I: theoretical results. In: IEEE 57th Annual Conference on Decision and Control (CDC) (2018c)","DOI":"10.1109\/CDC.2018.8619567"},{"issue":"2","key":"918_CR41","doi-asserted-by":"crossref","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":"918_CR42","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1080\/1055678031000148696","volume":"18","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M., Yamashita, M.: Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. 18, 535\u2013541 (2003)","journal-title":"Optim. Methods Softw."},{"key":"918_CR43","doi-asserted-by":"crossref","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Integer Programming and Combinatorial Optimization, pp. 293\u2013303. Springer (2001a)","DOI":"10.1007\/3-540-45535-3_23"},{"key":"918_CR44","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001b)","journal-title":"SIAM J. Optim."},{"key":"918_CR45","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1137\/05064504X","volume":"17","author":"JB Lasserre","year":"2006","unstructured":"Lasserre, J.B.: Convergent SDP-relaxations in polynomial optimization with sparsity. SIAM J. Optim. 17, 822\u2013843 (2006)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"918_CR46","doi-asserted-by":"crossref","first-page":"2461","DOI":"10.1137\/14097865X","volume":"25","author":"M Laurent","year":"2015","unstructured":"Laurent, M., Piovesan, T.: Conic approach to quantum graph parameters using linear optimization over the completely positive semidefinite cone. SIAM J. Optim. 25(4), 2461\u20132493 (2015)","journal-title":"SIAM J. Optim."},{"key":"918_CR47","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3984-4","volume-title":"Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications","author":"Z Li","year":"2012","unstructured":"Li, Z., He, S., Zhang, S.: Approximation Methods for Polynomial Optimization: Models, Algorithms, and Applications. Springer, Berlin (2012)"},{"issue":"2","key":"918_CR48","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"918_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/050642691","volume":"18","author":"Z Luo","year":"2007","unstructured":"Luo, Z., Sidiropoulos, N., Tseng, P., Zhang, S.: Approximation bounds for quadratic optimization with homogeneous quadratic constraints. SIAM J. Optim. 18, 1\u201328 (2007)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"918_CR50","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"ZQ Luo","year":"2010","unstructured":"Luo, Z.Q., Wk, Ma., So, A.M.C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27(3), 20 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"918_CR51","unstructured":"Madani, R., Fazelnia, G., Lavaei, J.: Rank-2 matrix solution for semidefinite relaxations of arbitrary polynomial optimization problems. Preprint (2014)"},{"key":"918_CR52","doi-asserted-by":"crossref","unstructured":"Madani, R., Lavaei, J., Baldick, R.: Convexification of power flow problem over arbitrary networks. In: 2015 54th IEEE Conference on Decision and Control (CDC), pp. 1\u20138. IEEE (2015a)","DOI":"10.1109\/CDC.2015.7402079"},{"issue":"1","key":"918_CR53","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TPWRS.2014.2322051","volume":"30","author":"R Madani","year":"2015","unstructured":"Madani, R., Sojoudi, S., Lavaei, J.: Convex relaxation for optimal power flow problem: Mesh networks. IEEE Trans. Power Syst. 30(1), 199\u2013211 (2015b)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"918_CR54","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1109\/TPWRS.2015.2411391","volume":"31","author":"R Madani","year":"2016","unstructured":"Madani, R., Ashraphijuo, M., Lavaei, J.: Promises of conic relaxation for contingency-constrained optimal power flow problem. IEEE Trans. Power Syst. 31(2), 1297\u20131307 (2016)","journal-title":"IEEE Trans. Power Syst."},{"key":"918_CR55","unstructured":"Madani, R., Atamt\u00fcrk, A., Davoudi, A.: A scalable semidefinite relaxation approach to grid scheduling. arXiv preprint arXiv:1707.03541 (2017a)"},{"issue":"2","key":"918_CR56","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/14099379X","volume":"27","author":"R Madani","year":"2017","unstructured":"Madani, R., Sojoudi, S., Fazelnia, G., Lavaei, J.: Finding low-rank solutions of sparse linear matrix inequalities using convex optimization. SIAM J. Optim. 27(2), 725\u2013758 (2017b)","journal-title":"SIAM J. Optim."},{"key":"918_CR57","doi-asserted-by":"crossref","unstructured":"Majumdar, A., Ahmadi, A.A., Tedrake, R.: Control and verification of high-dimensional systems with DSOS and SDSOS programming. In: 2014 IEEE 53rd Annual Conference on Decision and Control (CDC), pp. 394\u2013401. IEEE (2014)","DOI":"10.1109\/CDC.2014.7039413"},{"issue":"3","key":"918_CR58","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1109\/TSP.2002.808112","volume":"51","author":"B Mariere","year":"2003","unstructured":"Mariere, B., Luo, Z.Q., Davidson, T.N.: Blind constant modulus equalization via convex optimization. IEEE Trans. Signal Process. 51(3), 805\u2013818 (2003)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"918_CR59","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.orl.2018.12.003","volume":"47","author":"A Mohammad-Nezhad","year":"2019","unstructured":"Mohammad-Nezhad, A., Terlaky, T.: A rounding procedure for semidefinite optimization. Oper. Res. Lett. 47(1), 59\u201365 (2019)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"918_CR60","doi-asserted-by":"crossref","first-page":"A3291","DOI":"10.1137\/15M101628X","volume":"38","author":"C Mu","year":"2016","unstructured":"Mu, C., Zhang, Y., Wright, J., Goldfarb, D.: Scalable robust matrix recovery: Frank-Wolfe meets proximal methods. SIAM J. Sci. Comput. 38(5), A3291\u2013A3317 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"918_CR61","first-page":"164","volume":"46","author":"M Muramatsu","year":"2003","unstructured":"Muramatsu, M., Suzuki, T.: A new second-order cone programming relaxation for max-cut problems. J. Oper. Res. Soc. Jpn. 46, 164\u2013177 (2003)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"918_CR62","doi-asserted-by":"crossref","unstructured":"Murphy, S., Robshaw, M.J.: Essential algebraic structure within the AES. In: Annual International Cryptology Conference, pp. 1\u201316. Springer (2002)","DOI":"10.1007\/3-540-45708-9_1"},{"key":"918_CR63","unstructured":"Natarajan. K., Shi, D., Toh, K.C.: A penalized quadratic convex reformulation method for random quadratic unconstrained binary optimization. Optimization Online (2013)"},{"key":"918_CR64","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Softw. 9, 141\u2013160 (1998)","journal-title":"Optim. Methods Softw."},{"key":"918_CR65","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming (Vol. 13). SIAM (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"3","key":"918_CR66","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1137\/110843265","volume":"23","author":"D Papp","year":"2013","unstructured":"Papp, D., Alizadeh, F.: Semidefinite characterization of sum-of-squares cones in algebras. SIAM J. Optim. 23(3), 1398\u20131423 (2013)","journal-title":"SIAM J. Optim."},{"key":"918_CR67","unstructured":"Pereira, J., Ibrahimi, M., Montanari, A.: Learning networks of stochastic differential equations. In: Advances in Neural Information Processing Systems, pp. 172\u2013180 (2010)"},{"key":"918_CR68","unstructured":"Permenter, F., Parrilo, P.: Partial facial reduction: simplified, equivalent SDPS via approximations of the psd cone. Mathematical Programming, pp. 1\u201354 (2014)"},{"issue":"12","key":"918_CR69","first-page":"1984","volume":"50","author":"M Rotkowitz","year":"2005","unstructured":"Rotkowitz, M., Lall, S.: A characterization of convex problems in decentralized control. IEEE Trans. Autom. Control 50(12), 1984\u20131996 (2005)","journal-title":"IEEE Trans. Autom. Control"},{"key":"918_CR70","unstructured":"Sarkar, T., Rakhlin, A.: How fast can linear dynamical systems be learned? arXiv preprint arXiv:1812.01251 (2018)"},{"issue":"3","key":"918_CR71","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"918_CR72","doi-asserted-by":"crossref","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems, vol. 31. Springer, Berlin (2013)","DOI":"10.1007\/978-1-4419-7997-1_45"},{"issue":"1","key":"918_CR73","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.acha.2010.02.001","volume":"30","author":"A Singer","year":"2011","unstructured":"Singer, A.: Angular synchronization by eigenvectors and semidefinite programming. Appl. Comput. Harmonic Anal. 30(1), 20\u201336 (2011)","journal-title":"Appl. Comput. Harmonic Anal."},{"key":"918_CR74","doi-asserted-by":"crossref","unstructured":"Sojoudi, S., Lavaei, J.: On the exactness of semidefinite relaxation for nonlinear optimization over graphs: Part I. In: 2013 IEEE 52nd Annual Conference on Decision and Control (CDC), pp. 1043\u20131050. IEEE (2013a)","DOI":"10.1109\/CDC.2013.6760020"},{"key":"918_CR75","doi-asserted-by":"crossref","unstructured":"Sojoudi, S., Lavaei, J.: On the exactness of semidefinite relaxation for nonlinear optimization over graphs: part II. In: 2013 IEEE 52nd Annual Conference on Decision and Control (CDC), pp. 1043\u20131050. IEEE (2013b)","DOI":"10.1109\/CDC.2013.6760021"},{"key":"918_CR76","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"918_CR77","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/9.661609","volume":"43","author":"O Toker","year":"1998","unstructured":"Toker, O., Ozbay, H.: On the complexity of purely complex $$\\mu $$ computation and related problems in multidimensional systems. IEEE Trans. Autom. Control 43(3), 409\u2013414 (1998)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"12","key":"918_CR78","doi-asserted-by":"crossref","first-page":"4234","DOI":"10.1109\/TAC.2018.2819246","volume":"63","author":"YS Wang","year":"2018","unstructured":"Wang, Y.S., Matni, N., Doyle, J.C.: Separable and localized system-level synthesis for large-scale systems. IEEE Trans. Autom. Control 63(12), 4234\u20134249 (2018)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"10","key":"918_CR79","doi-asserted-by":"publisher","first-page":"4079","DOI":"10.1109\/TAC.2018.2890753","volume":"64","author":"YS Wang","year":"2019","unstructured":"Wang, Y.S., Matni, N., Doyle, J.C.: A system-level approach to controller synthesis. IEEE Trans. Autom. Control 64(10), 4079\u20134093 (2019). https:\/\/doi.org\/10.1109\/TAC.2018.2890753","journal-title":"IEEE Trans. Autom. Control"},{"key":"918_CR80","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008370723217","volume":"15","author":"Y Ye","year":"1999","unstructured":"Ye, Y.: Approximating global quadratic optimization with convex quadratic constraints. J. Global Optim. 15, 1\u201317 (1999a)","journal-title":"J. Global Optim."},{"key":"918_CR81","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y Ye","year":"1999","unstructured":"Ye, Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84, 219\u2013226 (1999b)","journal-title":"Math. Program."},{"key":"918_CR82","doi-asserted-by":"crossref","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, 453\u2013465 (2000)","journal-title":"Math. Program."},{"key":"918_CR83","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/04061341X","volume":"87","author":"S Zhang","year":"2006","unstructured":"Zhang, S., Huang, Y.: Complex quadratic optimization and semidefinite programming. SIAM J. Optim. 87, 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"key":"918_CR84","doi-asserted-by":"crossref","unstructured":"Zohrizadeh, F., Kheirandishfard, M., Nasir, A., Madani, R.: Sequential relaxation of unit commitment with AC transmission constraints. In: IEEE 57th Annual Conference on Decision and Control (CDC) (2018a)","DOI":"10.1109\/CDC.2018.8619609"},{"key":"918_CR85","doi-asserted-by":"crossref","unstructured":"Zohrizadeh, F., Kheirandishfard, M., Quarm, E., Madani, R.: Penalized parabolic relaxation for optimal power flow problem. In: IEEE 57th Annual Conference on Decision and Control (CDC) (2018b)","DOI":"10.1109\/CDC.2018.8619374"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00918-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00918-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00918-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T17:23:35Z","timestamp":1667064215000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00918-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,21]]},"references-count":85,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["918"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00918-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,21]]},"assertion":[{"value":"4 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}