乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T13:32:21Z","timestamp":1684416741556},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T00:00:00Z","timestamp":1564099200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10898-019-00813-x","type":"journal-article","created":{"date-parts":[[2019,7,26]],"date-time":"2019-07-26T04:41:59Z","timestamp":1564116119000},"page":"913-932","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3458-123X","authenticated-orcid":false,"given":"Florian","family":"Jarre","sequence":"first","affiliation":[]},{"given":"Felix","family":"Lieder","sequence":"additional","affiliation":[]},{"given":"Ya-Feng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Cheng","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,26]]},"reference":[{"issue":"1\u20132","key":"813_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0166-218X(01)00266-9","volume":"119","author":"MF Anjos","year":"2002","unstructured":"Anjos, M.F., Wolkowicz, H.: Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Appl. Math. 119(1\u20132), 79\u2013106 (2002)","journal-title":"Discrete Appl. Math."},{"key":"813_CR2","unstructured":"Bandeira, A.: Convex relaxations for certain inverse problems on graphs, Ph.D. Thesis, Princeton (2015)"},{"issue":"3","key":"813_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/moor.28.3.497.16392","volume":"28","author":"A Ben-Tal","year":"2003","unstructured":"Ben-Tal, A., Nemirovski, A., Roos, C.: Extended matrix cube theorems with applications to $$\\mu $$-theory in control. Math. Oper. Res. 28(3), 497\u2013523 (2003)","journal-title":"Math. Oper. Res."},{"key":"813_CR4","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120, 479\u2013495 (2009)","journal-title":"Math. Program."},{"key":"813_CR5","first-page":"201","volume-title":"Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, International Series in Operational Research and Management Science","author":"S Burer","year":"2011","unstructured":"Burer, S.: Copositive programming. In: Anjos, M., Lasserre, J. (eds.) Handbook of Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, International Series in Operational Research and Management Science, pp. 201\u2013218. Springer, Berlin (2011)"},{"key":"813_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"1120","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.B.: Representing quadratically constrained quadratic programs as generalized copositive programs. OR Res. Lett. 1120, 203\u2013206 (2012)","journal-title":"OR Res. Lett."},{"issue":"6","key":"813_CR7","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1007\/s11590-013-0645-2","volume":"7","author":"P Dickinson","year":"2013","unstructured":"Dickinson, P., Eichfelder, G., Povh, J.: Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets. Optim. Lett. 7(6), 1387\u20131397 (2013)","journal-title":"Optim. Lett."},{"key":"813_CR8","doi-asserted-by":"publisher","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 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"813_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.13001\/1081-3810.1648","volume":"26","author":"MS Gowda","year":"2013","unstructured":"Gowda, M.S., Sznajder, R.: On the irreducibility, self-duality an non-homogeneity of completely positive cones. Electron. J. Linear Algebra 26, 177\u2013191 (2013)","journal-title":"Electron. J. Linear Algebra"},{"key":"813_CR10","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0095-8956(86)90087-0","volume":"B40","author":"M Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Relaxations of vertex packing. J. Comb. Theory B40, 330\u2013343 (1986)","journal-title":"J. Comb. Theory"},{"issue":"4\u20135","key":"813_CR11","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.B., Loefberg, J.: GloptiPoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"813_CR12","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1287\/moor.1070.0268","volume":"32","author":"Y Huang","year":"2007","unstructured":"Huang, Y., Zhang, S.: Complex matrix decomposition and quadratic programming. Math. Oper. Res. 32(3), 758\u2013768 (2007)","journal-title":"Math. Oper. Res."},{"key":"813_CR13","unstructured":"Jarre, F., Lieder, F.: A Derivative-Free and Ready-to-Use NLP Solver for Matlab or Octave (2017). \nhttp:\/\/www.optimization-online.org\/DB_HTML\/2017\/05\/5996.html\n\n. Accessed 23 July 2019"},{"issue":"3","key":"813_CR14","doi-asserted-by":"publisher","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(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"813_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1137\/S1052623400379371","volume":"12","author":"M Laurent","year":"2002","unstructured":"Laurent, M.: Tighter linear and semidefinite relaxations for max-cut based on the Lovasz\u2013Schrijver lift-and-project procedure. SIAM J. Optim. 12, 345\u2013375 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"813_CR16","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s10589-015-9731-y","volume":"61","author":"F Lieder","year":"2015","unstructured":"Lieder, F., Rad, F.B.A., Jarre, F.: Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques. Comput. Optim. Appl. 61(3), 669\u2013688 (2015)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"813_CR17","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(1), 719\u2013742 (2019)","journal-title":"SIAM J. Optim."},{"key":"813_CR18","doi-asserted-by":"publisher","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":"813_CR19","unstructured":"Papachristodoulou, A., Anderson, J., Valmorbida, G., Prajna, S., Seiler, P., Parrilo, P.A.: SOSTOOLS: Sum of Squares Optimization Toolbox for MATLAB (2016). \nhttp:\/\/www.eng.ox.ac.uk\/control\/sostools\n\n, \narXiv:1310.4716\n\n. Accessed 23 July 2019"},{"issue":"2","key":"813_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"121","author":"F Rendl","year":"2010","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations. Math. Program. 121(2), 307\u2013335 (2010)","journal-title":"Math. Program."},{"key":"813_CR21","unstructured":"Rendl, F., Rinaldi, G., Wiegele, A.: Biq Mac Solver\u2014Binary Quadratic and Max Cut Solver. \nhttp:\/\/biqmac.uni-klu.ac.at\/\n\n. Accessed 23 July 2019"},{"issue":"6","key":"813_CR22","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1109\/TSP.2006.872578","volume":"54","author":"N Sidiropoulos","year":"2006","unstructured":"Sidiropoulos, N., Davidson, T., Luo, Z.-Q.: Transmit beamforming for physical-layer multicasting. IEEE Trans. Signal Process. 54(6), 2239\u20132251 (2006)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"813_CR23","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.-W., Ye, Y.Y.: On approximating complex quadratic optimization problems via semidefinite programming relaxations. Math. Program. 110(1), 93\u2013110 (2007)","journal-title":"Math. Program."},{"key":"813_CR24","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"813_CR25","unstructured":"SeDuMi Download Page. \nhttp:\/\/sedumi.ie.lehigh.edu\/\n\n. Accessed 23 July 2019"},{"key":"813_CR26","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., Tutuncu, R.H.: SDPT3\u2014a Matlab software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"813_CR27","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/9.661609","volume":"43","author":"O Toker","year":"1998","unstructured":"Toker, O., \u00d6zbay, 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"},{"key":"813_CR28","unstructured":"Wolfram$$\\mid $$Alpha: Computational Knowledge Engine (2018). \nhttps:\/\/www.wolframalpha.com\/\n\n. Accessed 23 July 2019"},{"key":"813_CR29","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Fujisawa, K., Fukuda, M., Kobayashi, K., Nakata, K., Nakata, M.: Latest developments in the SDPA Family for solving large-scale SDPs. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Cone and Polynomial Optimization: Theory, Algorithms, Software and Applications, International Series in Operations Research & Management Science. Springer, US (2012)","DOI":"10.1007\/978-1-4614-0769-0_24"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00813-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00813-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00813-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,24]],"date-time":"2020-07-24T23:09:33Z","timestamp":1595632173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00813-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,26]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["813"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00813-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,26]]},"assertion":[{"value":"6 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}