{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:40:24Z","timestamp":1774557624659,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T00:00:00Z","timestamp":1383868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10589-013-9618-8","type":"journal-article","created":{"date-parts":[[2013,11,7]],"date-time":"2013-11-07T18:25:03Z","timestamp":1383848703000},"page":"27-45","source":"Crossref","is-referenced-by-count":12,"title":["Faster, but weaker, relaxations for quadratically constrained quadratic programs"],"prefix":"10.1007","volume":"59","author":[{"given":"Samuel","family":"Burer","sequence":"first","affiliation":[]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,8]]},"reference":[{"key":"9618_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","volume":"95","author":"S. Burer","year":"2003","unstructured":"Burer, S., Monteiro, R.: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Math. Program., Ser. B 95, 329\u2013357 (2003)","journal-title":"Math. Program., Ser. B"},{"issue":"2","key":"9618_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-008-0246-5","volume":"122","author":"E. Klerk de","year":"2010","unstructured":"de Klerk, E., Sotirov, R.: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. Math. Program., Ser. A 122(2), 225\u2013246 (2010)","journal-title":"Math. Program., Ser. A"},{"issue":"4","key":"9618_CR3","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. Glob. Optim. 10(4), 367\u2013380 (1997)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9618_CR4","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S1052623400366218","volume":"11","author":"M. Fukuda","year":"2000","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 (2000)","journal-title":"SIAM J. Optim."},{"key":"9618_CR5","unstructured":"See the website: www.gamsworld.org\/global\/globallib\/globalstat.htm"},{"key":"9618_CR6","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M. Goemans","year":"1995","unstructured":"Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9618_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R. Grone","year":"1984","unstructured":"Grone, R., Johnson, C., S\u00e1, E., Wolkowicz, H.: Positive definite completions of partial Hermitian matrices. Linear Algebra Appl. 58, 109\u2013124 (1984)","journal-title":"Linear Algebra Appl."},{"key":"9618_CR8","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10, 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3\u20134","key":"9618_CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1080\/10556780108805819","volume":"15","author":"S. Kim","year":"2001","unstructured":"Kim, S., Kojima, M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Methods Softw. 15(3\u20134), 201\u2013224 (2001)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"9618_CR10","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1137\/S1052623498336450","volume":"10","author":"M. Kojima","year":"2000","unstructured":"Kojima, M., Tun\u00e7el, L.: Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10(3), 750\u2013778 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9618_CR11","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J.B. 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":"9618_CR12","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0927-0507(05)12008-8","volume-title":"Handbook on Discrete Optimization","author":"M. Laurent","year":"2005","unstructured":"Laurent, M., Rendl, F.: Semidefinite programming and integer programming. In: Karen Aardal, R.W., Nemhauser, G. (eds.) Handbook on Discrete Optimization, pp. 393\u2013514. Elsevier, Amsterdam (2005)"},{"key":"9618_CR13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"9618_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10107-003-0451-1","volume":"97","author":"R.D.C. Monteiro","year":"2003","unstructured":"Monteiro, R.D.C.: First- and second-order methods for semidefinite programming. Math. Program. 97, 209\u2013244 (2003)","journal-title":"Math. Program."},{"issue":"2","key":"9618_CR15","doi-asserted-by":"crossref","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., Ser. B 95(2), 303\u2013327 (2003). Computational semidefinite and second order cone programming: the state of the art","journal-title":"Math. Program., Ser. B"},{"issue":"2","key":"9618_CR16","doi-asserted-by":"crossref","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 (2010)","journal-title":"Math. Program."},{"key":"9618_CR17","author":"A. Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. (2010). doi: 10.1007\/s10107-010-0340-3","journal-title":"Math. Program."},{"key":"9618_CR18","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"H.D. Sherali","year":"1997","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Dordrecht (1997)"},{"key":"9618_CR19","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1137\/080718206","volume":"20","author":"X. Zhao","year":"2010","unstructured":"Zhao, X., Sun, D., Toh, K.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737\u20131765 (2010)","journal-title":"SIAM J. Optim."},{"key":"9618_CR20","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s10898-010-9630-9","volume":"50","author":"X. Zheng","year":"2011","unstructured":"Zheng, X., Sun, X., Li, D.: Nonconvex quadratically constrained quadratic programming: best d.c. decompositions and their sdp representations. J. Glob. Optim. 50, 695\u2013712 (2011)","journal-title":"J. Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9618-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9618-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T04:41:34Z","timestamp":1564634494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9618-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,8]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9618"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9618-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,8]]}}}