{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:18:34Z","timestamp":1780345114814,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,18]],"date-time":"2011-05-18T00:00:00Z","timestamp":1305676800000},"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":[[2011,9]]},"DOI":"10.1007\/s10107-011-0462-2","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T04:05:07Z","timestamp":1305605107000},"page":"129-157","source":"Crossref","is-referenced-by-count":116,"title":["Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons"],"prefix":"10.1007","volume":"129","author":[{"given":"Xiaowei","family":"Bao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohit","family":"Tawarmalani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,5,18]]},"reference":[{"key":"462_CR1","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1021\/ie980666q","volume":"38","author":"N. Adhya","year":"1999","unstructured":"Adhya N., Tawarmalani M., Sahinidis N.V.: A Lagrangian approach to the pooling problem. Ind. Eng. Chem. 38, 1956\u20131972 (1999)","journal-title":"Ind. Eng. Chem."},{"key":"462_CR2","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0377-2217(92)90082-K","volume":"60","author":"F.A. Al-Khayyal","year":"1992","unstructured":"Al-Khayyal F.A.: Generalized bilinear programming: Part I. Models, applications and linear programming relaxation. Eur. J. Oper. Res. 60, 306\u2013314 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"462_CR3","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F.A. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal F.A., Falk J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8, 273\u2013286 (1983)","journal-title":"Math. Oper. Res."},{"key":"462_CR4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01099462","volume":"6","author":"F.A. Al-Khayyal","year":"1995","unstructured":"Al-Khayyal F.A., Larsen C., Van Voorhis T.: A relaxation method for nonconvex quadratically constrained quadratic programs. J. Global Optim. 6, 215\u2013230 (1995)","journal-title":"J. Global Optim."},{"key":"462_CR5","unstructured":"Anstreicher, K., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. http:\/\/www.dollar.biz.uiowa.edu\/~sburer\/papers\/023-qphull.pdf (2007)"},{"key":"462_CR6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"K.M. Anstreicher","year":"2009","unstructured":"Anstreicher K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"issue":"2","key":"462_CR7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-004-4312-0","volume":"33","author":"K.M. Anstreicher","year":"2005","unstructured":"Anstreicher K.M., Burer S.: DC versus copositive bounds for standard QP. J. Global Optim. 33(2), 299\u2013312 (2005)","journal-title":"J. Global Optim."},{"key":"462_CR8","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X. Bao","year":"2009","unstructured":"Bao X., Sahinidis N.V., Tawarmalani M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24, 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"key":"462_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.S.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2001)"},{"key":"462_CR10","unstructured":"Benson, S.J., Ye, Y.: DSDP5: Software for semidefinite programming. Tech. Rep. ANL\/MCS-P1289-0905, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL. ACM Trans. Math. Softw. http:\/\/www.mcs.anl.gov\/~benson\/dsdp (submitted, 2005)"},{"key":"462_CR11","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"I.M. Bomze","year":"2002","unstructured":"Bomze I.M., de Klerk E.: Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24, 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"4","key":"462_CR12","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I.M. Bomze","year":"2000","unstructured":"Bomze I.M., Dur M., de Klerk E., Roos C., Quist A.J., Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Global Optim. 18(4), 301\u2013320 (2000)","journal-title":"J. Global Optim."},{"issue":"1","key":"462_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s11590-006-0018-1","volume":"1","author":"I.M. Bomze","year":"2007","unstructured":"Bomze I.M., Frommlet F., Rubey M.: Improved SDP bounds for minimizing quadratic functions over the l(1)-ball. Optim. Lett. 1(1), 49\u201359 (2007)","journal-title":"Optim. Lett."},{"issue":"1","key":"462_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"I.M. Bomze","year":"2008","unstructured":"Bomze I.M., Locatelli M., Tardella F.: New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability. Math. Program. 115(1), 31\u201364 (2008)","journal-title":"Math. Program."},{"key":"462_CR15","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1080\/10556789908805765","volume":"11","author":"B. Borchers","year":"1999","unstructured":"Borchers B.: CSDP, A C library for semidefinite programming. Optim. Methods Softw. 11, 613\u2013623 (1999)","journal-title":"Optim. Methods Softw."},{"key":"462_CR16","volume-title":"GAMS\u2014A User\u2019s Guide","author":"A. Brooke","year":"1988","unstructured":"Brooke A., Kendrick D., Meeraus A.: GAMS\u2014A User\u2019s Guide. The Scientific Press, Redwood City, CA (1988)"},{"key":"462_CR17","unstructured":"Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Tech. rep., University of Iowa, Iowa City, IA. http:\/\/www.optimization-online.org\/DB_FILE\/2009\/01\/2184.pdf (2008)"},{"issue":"2","key":"462_CR18","doi-asserted-by":"crossref","first-page":"295","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(2), 295\u2013479 (2009)","journal-title":"Math. Program."},{"key":"462_CR19","unstructured":"Burer, S., Chen, J.: Relaxing the optimality conditions of box QP. Tech. rep., Dept. of Management Sciences, University of Iowa, Iowa City, IA 52240. Available at http:\/\/www.optimization-online.org\/DB_FILE\/2007\/10\/1815.pdf (2007)"},{"key":"462_CR20","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"112","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. 112, 259\u2013282 (2008)","journal-title":"Math. Program."},{"key":"462_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"M.C. Dorneich","year":"1995","unstructured":"Dorneich M.C., Sahinidis N.V.: Global optimization algorithms for chip layout and compaction. Eng. Optim. 25, 131\u2013154 (1995)","journal-title":"Eng. Optim."},{"key":"462_CR22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T. Fujie","year":"1997","unstructured":"Fujie T., Kojima M.: Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Optim. 10, 367\u2013380 (1997)","journal-title":"J. Global Optim."},{"key":"462_CR23","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. 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":"462_CR24","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01917102","volume":"26","author":"E.P. Hao","year":"1982","unstructured":"Hao E.P.: Quadratically constrained quadratic programming: some applications and a method for solution. Math. Methods Oper. Res. 26, 105\u2013119 (1982)","journal-title":"Math. Methods Oper. Res."},{"key":"462_CR25","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0582-7","volume":"103","author":"J. Linderoth","year":"2005","unstructured":"Linderoth J.: A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math. Program. 103, 251\u2013282 (2005)","journal-title":"Math. Program."},{"key":"462_CR26","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/S0377-2217(96)00025-2","volume":"100","author":"M.L. Liu","year":"1997","unstructured":"Liu M.L., Sahinidis N.V.: Process planning in a fuzzy environment. Eur. J. Oper. Res. 100, 142\u2013169 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"462_CR27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0166-218X(01)00359-6","volume":"122","author":"M. Locatelli","year":"2002","unstructured":"Locatelli M., Raber U.: Packing equal circles in a square: a deterministic global optimization approach. Discret. Appl. Math. 122, 139\u2013166 (2002)","journal-title":"Discret. Appl. Math."},{"key":"462_CR28","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick G.P.: Computability of global solutions to factorable nonconvex programs: Part I\u2014Convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"462_CR29","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10107-002-0355-5","volume":"95","author":"H.D. Mittelmann","year":"2003","unstructured":"Mittelmann H.D.: An independent benchmarking of SDP and SOCP solvers. Math. Program. 95, 407\u2013430 (2003)","journal-title":"Math. Program."},{"key":"462_CR30","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1008315627883","volume":"14","author":"I. Nowak","year":"1999","unstructured":"Nowak I.: A new semidefinite programming bound for indefinite quadratic forms over a simplex. J. Global Optim. 14, 357\u2013364 (1999)","journal-title":"J. Global Optim."},{"key":"462_CR31","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I. P\u00f3lik","year":"2007","unstructured":"P\u00f3lik I., Terlaky T.: A survey of the S-Lemma. SIAM Rev. 49, 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"issue":"1","key":"462_CR32","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak S., Rendl F., Wolkowicz H.: A recipe for semidefinite relaxation for (0,1)-quadratic programming. J. Global Optim. 7(1), 51\u201373 (1995)","journal-title":"J. Global Optim."},{"key":"462_CR33","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/10556789808805692","volume":"9","author":"A.J. Quist","year":"1998","unstructured":"Quist A.J., de Klerk E., Roos C., Terlaky T.: Copositive relaxations for general quadratic programming. Optim. Methods Softw. 9, 185\u2013208 (1998)","journal-title":"Optim. Methods Softw."},{"key":"462_CR34","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1008217604285","volume":"10","author":"A.D. Rikun","year":"1997","unstructured":"Rikun A.D.: A convex envelope formula for multilinear functions. J. Global Optim. 10, 425\u2013437 (1997)","journal-title":"J. Global Optim."},{"key":"462_CR35","volume-title":"Convex Analysis Princeton. Mathematical Series","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.: Convex Analysis Princeton. Mathematical Series. Princeton University Press, Princeton (1970)"},{"key":"462_CR36","first-page":"245","volume":"22","author":"H.D. Sherali","year":"1997","unstructured":"Sherali H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Mathematica Vietnamica 22, 245\u2013270 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"issue":"1","key":"462_CR37","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10479-006-0107-7","volume":"149","author":"H.D. Sherali","year":"2007","unstructured":"Sherali H.D.: RLT: a unified approach for discrete and continuous nonconvex optimization. Ann. Oper. Res. 149(1), 185\u2013193 (2007)","journal-title":"Ann. Oper. Res."},{"key":"462_CR38","first-page":"1","volume":"25","author":"N.Z. Shor","year":"1987","unstructured":"Shor N.Z.: Quadratic optimization problems. Soviet J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Soviet J. Comput. Syst. Sci."},{"key":"462_CR39","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"N.Z. Shor","year":"1990","unstructured":"Shor N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25, 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"key":"462_CR40","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF00122430","volume":"2","author":"N.Z. Shor","year":"1992","unstructured":"Shor N.Z.: Dual estimates in multiextremal problems. J. Global Optim. 2, 411\u2013418 (1992)","journal-title":"J. Global Optim."},{"key":"462_CR41","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1023\/A:1016083231326","volume":"114","author":"A. Sutou","year":"2002","unstructured":"Sutou A., Dai Y.: Global optimization approach to unequal sphere packing problems in 3D. J. Optim. Theory Appl. 114, 671\u2013694 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"462_CR42","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."},{"key":"462_CR43","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1023\/A:1020383700229","volume":"24","author":"T. Van Voorhis","year":"2002","unstructured":"Van Voorhis T.: A global optimization algorithm using lagrangian underestimates and the interval Newton method. J. Global Optim. 24, 349\u2013370 (2002)","journal-title":"J. Global Optim."},{"key":"462_CR44","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"S.A. Vavasis","year":"1990","unstructured":"Vavasis S.A.: Quadratic programming is in NP. Inf. Process. Lett. 36, 73\u201377 (1990)","journal-title":"Inf. Process. Lett."},{"key":"462_CR45","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H.: Semidefinite and lagrangian relaxations for hard combinatorial problems. In: Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization, pp. 269\u2013310. Kluwer, B.V., Deventer, The Netherlands (2000)","DOI":"10.1007\/978-0-387-35514-6_13"},{"issue":"2","key":"462_CR46","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/S0377-2217(02)00295-3","volume":"143","author":"H. Wolkowicz","year":"2002","unstructured":"Wolkowicz H.: A note on lack of strong duality for quadratic problems with orthogonal constraints. Eur. J. Oper. Res. 143(2), 356\u2013364 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"462_CR47","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0166-218X(01)00352-3","volume":"123","author":"H. Wolkowicz","year":"2002","unstructured":"Wolkowicz H., Anjos M.F.: Semidefinite programming for discrete optimization and matrix completion problems. Discret. Appl. Math. 123(1\u20133), 513\u2013577 (2002)","journal-title":"Discret. Appl. Math."},{"key":"462_CR48","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Theory, Algorithms, and Applications. Kluwer (2000)","DOI":"10.1007\/978-1-4615-4381-7"},{"key":"462_CR49","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1016\/j.compchemeng.2007.05.003","volume":"32","author":"W. Xie","year":"2008","unstructured":"Xie W., Sahinidis N.V.: A branch-and-bound algorithm for the continuous facility layout problem. Comput. Chem. Eng. 32, 1016\u20131028 (2008)","journal-title":"Comput. Chem. Eng."},{"key":"462_CR50","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1080\/1055678031000118482","volume":"18","author":"M. Yamashita","year":"2003","unstructured":"Yamashita M., Fujisawa K., Kojima M.: Implementation and evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0). Optim. Methods Softw. 18, 491\u2013505 (2003)","journal-title":"Optim. Methods Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0462-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-011-0462-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-011-0462-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T20:40:08Z","timestamp":1560199208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-011-0462-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,18]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["462"],"URL":"https:\/\/doi.org\/10.1007\/s10107-011-0462-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,18]]}}}