{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:29:19Z","timestamp":1775068159618,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T00:00:00Z","timestamp":1165968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,3,12]]},"DOI":"10.1007\/s10107-006-0064-6","type":"journal-article","created":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T15:00:43Z","timestamp":1165935643000},"page":"93-110","source":"Crossref","is-referenced-by-count":210,"title":["On approximating complex quadratic optimization problems via semidefinite programming relaxations"],"prefix":"10.1007","volume":"110","author":[{"given":"Anthony Man-Cho","family":"So","sequence":"first","affiliation":[]},{"given":"Jiawei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yinyu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,13]]},"reference":[{"key":"64_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Makarychev, K., Makarychev, Y., Naor, A.: Quadratic forms on graphs. In: Proceedings of the 37th annual ACM symposium on theory of computing, pp. 486\u2013493 (2005)","DOI":"10.1145\/1060590.1060664"},{"key":"64_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Naor, A.: Approximating the Cut\u2013Norm via Grothendieck\u2019s inequality. In: Proceedings of the 36th annual ACM symposium on theory of computing, pp. 72\u201380 (2004)","DOI":"10.1145\/1007352.1007371"},{"issue":"3","key":"64_CR3","doi-asserted-by":"crossref","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. and Roos C. (2003). Extended matrix cube theorems with applications to\u00a0\u03bc\u2013theory in control. Math. Oper. Res. 28(3): 497\u2013523","journal-title":"Math. Oper. Res."},{"key":"64_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Wirth, A.: Maximizing quadratic programs: extending Grothendieck\u2019s inequality. In: Proceedings of the 45th annual IEEE symposium on foundations of computer science, pp. 54\u201360 (2004)","DOI":"10.1109\/FOCS.2004.39"},{"key":"64_CR5","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A. Frieze","year":"1997","unstructured":"Frieze A. and Jerrum M. (1997). Improved approximation algorithms for Max k\u2013Cut and Max bisection. Algorithmica 18: 67\u201381","journal-title":"Algorithmica"},{"key":"64_CR6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-1-4615-4381-7_12","volume-title":"Handbook of semidefinite programming: theory, algorithms and applications","author":"M.X. Goemans","year":"2000","unstructured":"Goemans M.X. and Rendl F. (2000). Combinatorial optimization. In: Wolkowicz, H., Saigal, R. and Vandenberghe, L. (eds) Handbook of semidefinite programming: theory, algorithms and applications, pp 343\u2013360. Kluwer, Dordrecht"},{"issue":"6","key":"64_CR7","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X. and Williamson D.P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6): 1115\u20131145","journal-title":"J. ACM"},{"issue":"2","key":"64_CR8","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1016\/j.jcss.2003.07.012","volume":"68","author":"M.X. Goemans","year":"2004","unstructured":"Goemans M.X. and Williamson D.P. (2004). Approximation algorithms for Max\u20133\u2013Cut and other problems via complex semidefinite programming. J. Comput. Syst. Sci. 68(2): 442\u2013470","journal-title":"J. Comput. Syst. Sci."},{"key":"64_CR9","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S. (ed): Approximation Algorithms for NP-hard problems. PWS Publishing Company, (1997)","DOI":"10.1145\/261342.571216"},{"key":"64_CR10","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s101070050100","volume":"86","author":"A. Nemirovski","year":"1999","unstructured":"Nemirovski A., Roos C. and Terlaky T. (1999). On maximization of quadratic form over intersection of ellipsoids with common center. Math. Prog. Ser. A 86: 463\u2013473","journal-title":"Math. Prog. Ser. A"},{"key":"64_CR11","unstructured":"Nesterov, Y.: Global quadratic optimization via conic relaxation, CORE Discussion Paper 9860. Universit\u00e9 Catholique de Louvain (1998)"},{"key":"64_CR12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02757725","volume":"19","author":"R.E. Rietz","year":"1974","unstructured":"Rietz R.E. (1974). A proof of the Grothendieck inequality. Israel J. Math. 19: 271\u2013276","journal-title":"Israel J. Math."},{"issue":"3","key":"64_CR13","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/9.661609","volume":"43","author":"O. Toker","year":"1998","unstructured":"Toker O. and \u00d6zbay H. (1998). On the complexity of purely complex\u00a0\u03bc computation and related problems in multidimensional systems. IEEE Trans Automat Control 43(3): 409\u2013414","journal-title":"IEEE Trans Automat Control"},{"issue":"1","key":"64_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L. Vandenberghe","year":"1996","unstructured":"Vandenberghe L. and Boyd S. (1996). Semidefinite programming. SIAM Rev 38(1): 49\u201395","journal-title":"SIAM Rev"},{"key":"64_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y. Ye","year":"1999","unstructured":"Ye Y. (1999). Approximating quadratic programming with bound and quadratic constraints. Math. Prog. 84: 219\u2013226","journal-title":"Math. Prog."},{"key":"64_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, S., Huang, Y.: Complex quadratic optimization and semidefinite programming. Technical Report SEEM 2004\u201303, Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, 2004. SIAM J. Optim. 16(3), 871\u2013890 (2006)","DOI":"10.1137\/04061341X"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0064-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0064-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0064-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:02Z","timestamp":1559123402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0064-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,13]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,12]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0064-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,13]]}}}