乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:26:49Z","timestamp":1729657609207,"version":"3.28.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"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","T2293774"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["E2ET0808X2"],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at UCAS","award":["N.A.","11771243"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10898-023-01305-9","type":"journal-article","created":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T06:05:34Z","timestamp":1687413934000},"page":"115-137","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem"],"prefix":"10.1007","volume":"88","author":[{"given":"Cheng","family":"Lu","sequence":"first","affiliation":[]},{"given":"Jitao","family":"Ma","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0563-5841","authenticated-orcid":false,"given":"Zhibin","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,22]]},"reference":[{"key":"1305_CR1","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1109\/TSP.2021.3094653","volume":"70","author":"A Arora","year":"2022","unstructured":"Arora, A., Tsinos, C.G., Bhavani Shankar, M.R., Chatinotas, S., Ottersten, B.: Efficient algorithms for constant-modulus analog beamforming. IEEE Trans. Signal Process. 70, 756\u2013771 (2022)","journal-title":"IEEE Trans. Signal Process."},{"key":"1305_CR2","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10898-021-01071-6","volume":"82","author":"G Azuma","year":"2022","unstructured":"Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. J. Glob. Optim. 82, 243\u2013262 (2022)","journal-title":"J. Glob. Optim."},{"key":"1305_CR3","first-page":"1","volume":"2022","author":"G Azuma","year":"2022","unstructured":"Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations for quadratic programs with bipartite graph structures. J. Glob. Optim. 2022, 1\u201321 (2022)","journal-title":"J. Glob. Optim."},{"issue":"1\u20132","key":"1305_CR4","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(1\u20132), 145\u2013167 (2017)","journal-title":"Math. Program."},{"issue":"4","key":"1305_CR5","doi-asserted-by":"publisher","first-page":"2355","DOI":"10.1137\/16M105808X","volume":"26","author":"N Boumal","year":"2016","unstructured":"Boumal, N.: Nonconvex phase synchronization. SIAM J. Optim. 26(4), 2355\u20132377 (2016)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1305_CR6","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":"3","key":"1305_CR7","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M Fukuda","year":"2001","unstructured":"Fukuda, M., Kojima, M., Murota, K., Nakata, K.: Exploiting sparsity in semidefinite programming via matrix completion I: general framework. SIAM J. Optim. 11(3), 647\u2013674 (2001)","journal-title":"SIAM J. Optim."},{"key":"1305_CR8","doi-asserted-by":"crossref","unstructured":"Jald\u00e9n, J., Martin, C., Ottersten, B.: Semidefinite programming for detection in linear systems\u2013Optimality conditions and space-time decoding. In: Proceedings 2003 IEEE international conference on acoustics, speech, and signal processing (ICASSP), pp. 9\u201312 (2003)","DOI":"10.1109\/ICASSP.2003.1202528"},{"key":"1305_CR9","unstructured":"Kassakian, P.W.: Convex approximation and optimization with applications in magnitude filter design and radiation pattern analysis. PhD Dissertation, Department of EECS, University of California, Berkeley (2006)"},{"issue":"1","key":"1305_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0402-6","volume":"129","author":"S Kim","year":"2001","unstructured":"Kim, S., Kojima, M., Mevissen, M., Yamashita, M.: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1), 33\u201368 (2001)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1305_CR11","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107-020-01526-w","volume":"190","author":"M Kocvara","year":"2021","unstructured":"Kocvara, M.: Decomposition of arrow type positive semidefinite matrices with application to topology optimization. Math. Program. 190(1\u20132), 105\u2013134 (2021)","journal-title":"Math. Program."},{"issue":"1","key":"1305_CR12","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. Glob. Optim. 70(1), 171\u2013187 (2018)","journal-title":"J. Glob. Optim."},{"issue":"14","key":"1305_CR13","doi-asserted-by":"publisher","first-page":"3761","DOI":"10.1109\/TSP.2017.2699640","volume":"65","author":"C Lu","year":"2017","unstructured":"Lu, C., Liu, Y.F.: An efficient global algorithm for single-group multicast beamforming. IEEE Trans. Signal Process. 65(14), 3761\u20133774 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"1305_CR14","doi-asserted-by":"publisher","first-page":"2862","DOI":"10.1109\/TSP.2004.834267","volume":"52","author":"WK 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(10), 2862\u20132872 (2004)","journal-title":"IEEE Trans. Signal Process."},{"issue":"6","key":"1305_CR15","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(6), 2683\u20132697 (2011)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"1305_CR16","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(2), 610\u2013621 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"1305_CR17","unstructured":"Mosek: Mosek ApS. http:\/\/www.mosek.com (2020)"},{"issue":"2","key":"1305_CR18","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10107-002-0351-9","volume":"95","author":"K Nakata","year":"2003","unstructured":"Nakata, K., Fujisawa, K., Fukuda, M., Kojima, M., Murota, K.: Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results. Math. Program. 95(2), 303\u2013327 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1305_CR19","doi-asserted-by":"publisher","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. Harmon. Anal. 30(1), 20\u201336 (2011)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"1305_CR20","doi-asserted-by":"crossref","unstructured":"So, A.M.C.: Probabilistic analysis of the semidefinite relaxation detector in digital communications. In: Proceedings of the twenty-first annual ACM-SIAM symposium on discrete algorithms (SODA\u201910), pp. 698\u2013711 (2010)","DOI":"10.1137\/1.9781611973075.57"},{"issue":"4","key":"1305_CR21","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1137\/130915261","volume":"24","author":"S Sojoudi","year":"2014","unstructured":"Sojoudi, S., Lavaei, J.: Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure. SIAM J. Optim. 24(4), 1746\u20131778 (2014)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"1305_CR22","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(5), 1221\u20131234 (2014)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"1305_CR23","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1109\/49.942507","volume":"19","author":"PH Tan","year":"2001","unstructured":"Tan, P.H., Rasmussen, L.K.: The application of semidefinite programming for detection in CDMA. IEEE J. Sel. Areas Commun. 19(8), 1442\u20131449 (2001)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"11","key":"1305_CR24","doi-asserted-by":"publisher","first-page":"2875","DOI":"10.1109\/TSP.2017.2666774","volume":"65","author":"J Tranter","year":"2017","unstructured":"Tranter, J., Sidiropoulos, N.D., Fu, X., Swami, A.: Fast unit-modulus least squares with applications in beamforming. IEEE Trans. Signal Process. 65(11), 2875\u20132887 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"1305_CR25","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1561\/2400000006","volume":"1","author":"L Vandenberghe","year":"2015","unstructured":"Vandenberghe, L., Andersen, M.: Chordal graphs and semidefinite optimization. Found. Trends Optim. 1(4), 241\u2013433 (2015)","journal-title":"Found. Trends Optim."},{"issue":"1\u20132","key":"1305_CR26","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(1\u20132), 47\u201381 (2015)","journal-title":"Math. Program."},{"issue":"1","key":"1305_CR27","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-020-01516-y","volume":"188","author":"RY Zhang","year":"2021","unstructured":"Zhang, R.Y., Lavaei, J.: Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion. Math. Program. 188(1), 351\u2013393 (2021)","journal-title":"Math. Program."},{"issue":"3","key":"1305_CR28","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(3), 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"1305_CR29","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/s10107-019-01366-3","volume":"180","author":"Y Zheng","year":"2020","unstructured":"Zheng, Y., Fantuuzzi, G., Papachristodoulou, A., Goulart, P., Wynn, A.: Chordal decomposition in operator-splitting methods for sparse semidefinite programs. Math. Program. 180(1\u20132), 489\u2013532 (2020)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01305-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-023-01305-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-023-01305-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T19:22:14Z","timestamp":1729624934000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-023-01305-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,22]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["1305"],"URL":"https:\/\/doi.org\/10.1007\/s10898-023-01305-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2023,6,22]]},"assertion":[{"value":"17 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}