{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:58Z","timestamp":1759335358164,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T00:00:00Z","timestamp":1683504000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171151","11701177","11688101","12021001"],"award-info":[{"award-number":["12171151","11701177","11688101","12021001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10898-023-01290-z","type":"journal-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T02:01:30Z","timestamp":1683511290000},"page":"255-275","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New semidefinite relaxations for a class of complex quadratic programming problems"],"prefix":"10.1007","volume":"87","author":[{"given":"Yingzhe","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1877-7531","authenticated-orcid":false,"given":"Cheng","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhibin","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-Feng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,8]]},"reference":[{"key":"1290_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-016-1059-6","volume":"163","author":"AS Bandeira","year":"2017","unstructured":"Bandeira, A.S., Boumal, N., Singer, A.: Tightness of the maximum likelihood semidefinite relaxation for angular synchronization. Math. Program. 163, 145\u2013167 (2017)","journal-title":"Math. Program."},{"key":"1290_CR2","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, 549\u2013577 (2017)","journal-title":"Math. Program."},{"key":"1290_CR3","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TPWRS.2016.2634586","volume":"32","author":"C Coffrin","year":"2017","unstructured":"Coffrin, C., Hijazi, H.L., Hentenryck, P.V.: Strengthening the SDP relaxation of AC power flows with convex envelopes, bound tightening, and valid inequalities. IEEE Trans. Power Syst. 32, 3549\u20133558 (2017)","journal-title":"IEEE Trans. Power Syst."},{"key":"1290_CR4","doi-asserted-by":"crossref","unstructured":"Demir, \u00d6.T., Tuncer, T.E.: Optimum discrete single group multicast beamforming. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP\u201914), pp. 7744\u20137748. IEEE Press, Florence (2014)","DOI":"10.1109\/ICASSP.2014.6855107"},{"key":"1290_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.dsp.2014.09.013","volume":"36","author":"\u00d6T Demir","year":"2015","unstructured":"Demir, \u00d6.T., Tuncer, T.E.: Optimum discrete transmit beamformer design. Digital Signal Process. 36, 57\u201368 (2015)","journal-title":"Digital Signal Process."},{"key":"1290_CR6","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximumcut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"1290_CR7","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/j.jcss.2003.07.012","volume":"68","author":"MX Goemans","year":"2004","unstructured":"Goemans, M.X., Williamson, D.P.: Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming. J. Comput. Syst. Sci. 68, 442\u2013470 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"1290_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/TCNS.2014.2309732","volume":"1","author":"SH Low","year":"2014","unstructured":"Low, S.H.: Convex relaxation of optimal power flow-Part I: formulations and equivalence. IEEE Trans. Control. Netw. Syst. 1, 15\u201327 (2014)","journal-title":"IEEE Trans. Control. Netw. Syst."},{"key":"1290_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TCNS.2014.2323634","volume":"1","author":"SH Low","year":"2014","unstructured":"Low, S.H.: Convex relaxation of optimal power flow-Part II: exactness. IEEE Trans. Control. Netw. Syst. 1, 177\u2013189 (2014)","journal-title":"IEEE Trans. Control. Netw. Syst."},{"key":"1290_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10898-017-0551-8","volume":"70","author":"C Lu","year":"2018","unstructured":"Lu, C., Deng, Z., Zhang, W.-Q., Fang, S.-C.: Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming. J. Global Optim. 70, 171\u2013187 (2018)","journal-title":"J. Global Optim."},{"key":"1290_CR11","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1137\/17M115075X","volume":"29","author":"C Lu","year":"2019","unstructured":"Lu, C., Liu, Y.-F., Zhang, W.-Q., Zhang, S.: Tightness of a new and enhanced semidefinite relaxation for MIMO detection. SIAM J. Optim. 29, 719\u2013742 (2019)","journal-title":"SIAM J. Optim."},{"key":"1290_CR12","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/OJSP.2020.3020221","volume":"1","author":"C Lu","year":"2020","unstructured":"Lu, C., Liu, Y.-F., Zhou, J.: An enhanced SDR based global algorithm for nonconvex complex quadratic programs with signal processing applications. IEEE Open J. Signal Process. 1, 120\u2013134 (2020)","journal-title":"IEEE Open J. Signal Process."},{"key":"1290_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"Z-Q Luo","year":"2010","unstructured":"Luo, Z.-Q., Ma, W.-K., So, A.M.-C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27, 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"1290_CR14","doi-asserted-by":"publisher","first-page":"2862","DOI":"10.1109\/TSP.2004.834267","volume":"52","author":"W-K Ma","year":"2004","unstructured":"Ma, W.-K., Ching, P.-C., Ding, Z.: Semidefinite relaxation based multiuser detection for M-ary PSK multiuser systems. IEEE Trans. Signal Process. 52, 2862\u20132872 (2004)","journal-title":"IEEE Trans. Signal Process."},{"key":"1290_CR15","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/TSP.2008.2008247","volume":"57","author":"AD Maio","year":"2009","unstructured":"Maio, A.D., Nicola, S.D., Huang, Y., Luo, Z.-Q., Zhang, S.: Design of phase codes for radar performance optimization with a similarity constraint. IEEE Trans. Signal Process. 57, 610\u2013621 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1290_CR16","doi-asserted-by":"publisher","first-page":"2683","DOI":"10.1109\/TSP.2011.2128313","volume":"59","author":"AD Maio","year":"2011","unstructured":"Maio, A.D., Huang, Y., Piezzo, M., Zhang, S., Farina, A.: Design of optimized radar codes with a peak to average power ratio constraint. IEEE Trans. Signal Process. 59, 2683\u20132697 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"1290_CR17","unstructured":"Mosek ApS. mosek. http:\/\/www.mosek.com (2020)"},{"key":"1290_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10107-006-0064-6","volume":"110","author":"AM-C So","year":"2007","unstructured":"So, A.M.-C., Zhang, J., Ye, Y.: On approximating complex quadratic optimization problems via semidefinite programming relaxations. Math. Program. 110, 93\u2013110 (2007)","journal-title":"Math. Program."},{"key":"1290_CR19","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1109\/TSP.2013.2296883","volume":"62","author":"M Soltanalian","year":"2014","unstructured":"Soltanalian, M., Stoica, P.: Designing unimodular codes via quadratic optimization. IEEE Trans. Signal Process. 62, 1221\u20131234 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1290_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-013-0738-9","volume":"149","author":"I Waldspurger","year":"2015","unstructured":"Waldspurger, I., d\u2019Aspremont, A., Mallat, S.: Phase recovery, MaxCut and complex semidefinite programming. Math. Program. 149, 47\u201381 (2015)","journal-title":"Math. Program."},{"key":"1290_CR21","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1137\/04061341X","volume":"16","author":"S Zhang","year":"2006","unstructured":"Zhang, S., Huang, Y.: Complex quadratic optimization and semidefinite programming. SIAM J. Optim. 16, 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"key":"1290_CR22","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1137\/20M1346912","volume":"31","author":"P-F Zhao","year":"2021","unstructured":"Zhao, P.-F., Li, Q.N., Chen, W.K., Liu, Y.-F.: An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection. SIAM J. Optim. 31, 1519\u20131545 (2021)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01290-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01290-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01290-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,29]],"date-time":"2023-07-29T06:08:05Z","timestamp":1690610885000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01290-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,8]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1290"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01290-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2023,5,8]]},"assertion":[{"value":"5 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}