{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T04:27:08Z","timestamp":1774499228367,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:00:00Z","timestamp":1559692800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:00:00Z","timestamp":1559692800000},"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":[[2019,10]]},"DOI":"10.1007\/s10898-019-00793-y","type":"journal-article","created":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T10:02:47Z","timestamp":1559728967000},"page":"461-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming"],"prefix":"10.1007","volume":"75","author":[{"given":"Rujun","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9786-6238","authenticated-orcid":false,"given":"Duan","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,5]]},"reference":[{"issue":"2\u20133","key":"793_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"K Anstreicher","year":"2009","unstructured":"Anstreicher, K.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2\u20133), 471\u2013484 (2009)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"793_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10107-012-0602-3","volume":"136","author":"K Anstreicher","year":"2012","unstructured":"Anstreicher, K.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2), 233\u2013251 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"793_CR3","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1137\/16M1078859","volume":"27","author":"K Anstreicher","year":"2017","unstructured":"Anstreicher, K.: Kronecker product constraints with an application to the two-trust-region subproblem. SIAM J. Optim. 27(1), 368\u2013378 (2017)","journal-title":"SIAM J. Optim."},{"issue":"1\u20133","key":"793_CR4","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0024-3795(99)00205-0","volume":"301","author":"K Anstreicher","year":"1999","unstructured":"Anstreicher, K., Chen, X., Wolkowicz, H., Yuan, Y.X.: Strong duality for a trust-region type relaxation of the quadratic assignment problem. Linear Algebra Appl. 301(1\u20133), 121\u2013136 (1999)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"793_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1137\/S0895479898340299","volume":"22","author":"K Anstreicher","year":"2000","unstructured":"Anstreicher, K., Wolkowicz, H.: On Lagrangian relaxation of quadratic matrix constraints. SIAM J. Matrix Anal. Appl. 22(1), 41\u201355 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"793_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"X Bao","year":"2011","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129(1), 129\u2013157 (2011)","journal-title":"Math. Program."},{"issue":"3","key":"793_CR7","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/050644471","volume":"17","author":"A Beck","year":"2006","unstructured":"Beck, A., Eldar, Y.C.: Strong duality in nonconvex quadratic optimization with two quadratic constraints. SIAM J. Optim. 17(3), 844\u2013860 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"793_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0710-8","volume":"143","author":"A Ben-Tal","year":"2014","unstructured":"Ben-Tal, A., den Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143(1\u20132), 1\u201329 (2014)","journal-title":"Math. Program."},{"key":"793_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-1-4615-6281-8_15","volume-title":"Communications, Computation, Control, and Signal Processing","author":"S Boyd","year":"1997","unstructured":"Boyd, S., Vandenberghe, L.: Semidefinite programming relaxations of non-convex problems in control and combinatorial optimization. In: Paulraj, A., Roychowdhury, V., Schaper, C.D. (eds.) Communications, Computation, Control, and Signal Processing, pp. 279\u2013287. Springer, Berlin (1997)"},{"issue":"1","key":"793_CR10","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1137\/110826862","volume":"23","author":"S Burer","year":"2013","unstructured":"Burer, S., Anstreicher, K.: Second-order-cone constraints for extended trust-region subproblems. SIAM J. Optim. 23(1), 432\u2013451 (2013)","journal-title":"SIAM J. Optim."},{"key":"793_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-1-4614-1927-3_13","volume-title":"Mixed Integer Nonlinear Programming","author":"S Burer","year":"2012","unstructured":"Burer, S., Saxena, A.: The MILP road to MIQCP. In: Leyffer, S., Lee, J. (eds.) Mixed Integer Nonlinear Programming, pp. 373\u2013405. Springer, Berlin (2012)"},{"issue":"2","key":"793_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","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. 113(2), 259\u2013282 (2008)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"793_CR13","first-page":"253","volume":"149","author":"S Burer","year":"2013","unstructured":"Burer, S., Yang, B.: The trust region subproblem with non-intersecting linear constraints. Math. Program. 149(1\u20132), 253\u2013264 (2013)","journal-title":"Math. Program."},{"key":"793_CR14","first-page":"71","volume":"1984","author":"M Celis","year":"1985","unstructured":"Celis, M., Dennis, J., Tapia, R.: A trust region strategy for nonlinear equality constrained optimization. Numer. Optim. 1984, 71\u201382 (1985)","journal-title":"Numer. Optim."},{"issue":"4","key":"793_CR15","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1007\/s10898-012-9842-2","volume":"56","author":"X Cui","year":"2013","unstructured":"Cui, X., Zheng, X., Zhu, S., Sun, X.: Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems. J. Glob. Optim. 56(4), 1409\u20131423 (2013)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"793_CR16","doi-asserted-by":"publisher","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":"6","key":"793_CR17","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 (JACM) 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM (JACM)"},{"key":"793_CR18","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control. Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer, Berlin (2008). \n                    https:\/\/web.stanford.edu\/~boyd\/papers\/graph_dcp.html"},{"key":"793_CR19","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.0 beta. \n                    http:\/\/cvxr.com\/cvx\n                    \n                  , September 2013"},{"key":"793_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/0-387-24273-2_2","volume-title":"The Schur Complement and Its Applications","author":"RA Horn","year":"2005","unstructured":"Horn, R.A., Zhang, F.: Basic properties of the Schur complement. In: Zhang, F. (ed.) The Schur Complement and Its Applications, pp. 17\u201346. Springer, Berlin (2005)"},{"issue":"1","key":"793_CR21","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s40305-013-0009-8","volume":"1","author":"Q Jin","year":"2013","unstructured":"Jin, Q., Tian, Y., Deng, Z., Fang, S.C., Xing, W.: Exact computable representation of some second-order cone constrained quadratic programming problems. J. Oper. Res. Soc. China 1(1), 107\u2013134 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1\u20132","key":"793_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10107-015-0874-5","volume":"156","author":"S Kim","year":"2016","unstructured":"Kim, S., Kojima, M., Toh, K.C.: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. 156(1\u20132), 161\u2013187 (2016)","journal-title":"Math. Program."},{"issue":"2","key":"793_CR23","doi-asserted-by":"publisher","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(2), 251\u2013282 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"793_CR24","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"ZQ Luo","year":"2010","unstructured":"Luo, Z.Q., Ma, W.K., So, A.M.C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27(3), 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"issue":"6","key":"793_CR25","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1287\/opre.33.6.1225","volume":"33","author":"L Mathiesen","year":"1985","unstructured":"Mathiesen, L.: Computational experience in solving equilibrium models by a sequence of linear complementarity problems. Oper. Res. 33(6), 1225\u20131250 (1985)","journal-title":"Oper. Res."},{"issue":"1","key":"793_CR26","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"key":"793_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-1-4614-1927-3_14","volume-title":"Mixed Integer Nonlinear Programming","author":"A Qualizza","year":"2012","unstructured":"Qualizza, A., Belotti, P., Margot, F.: Linear programming relaxations of quadratically constrained quadratic programs. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, pp. 407\u2013426. Springer, New York (2012). \n                    https:\/\/doi.org\/10.1007\/978-1-4614-1927-3_14"},{"key":"793_CR28","volume-title":"A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems","author":"HD Sherali","year":"2013","unstructured":"Sherali, H.D., Adams, W.P.: A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31. Springer, Berlin (2013)"},{"issue":"1\u20134","key":"793_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1013819515732","volume":"22","author":"HD Sherali","year":"2002","unstructured":"Sherali, H.D., Fraticelli, B.M.: Enhancing RLT relaxations via a new class of semidefinite cuts. J. Glob. Optim. 22(1\u20134), 233\u2013261 (2002)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"793_CR30","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25(6), 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"issue":"2","key":"793_CR31","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1287\/moor.28.2.246.14485","volume":"28","author":"JF Sturm","year":"2003","unstructured":"Sturm, J.F., Zhang, S.: On cones of nonnegative quadratic functions. Math. Oper. Res 28(2), 246\u2013267 (2003)","journal-title":"Math. Oper. Res"},{"issue":"2","key":"793_CR32","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90100-C","volume":"36","author":"SA Vavasis","year":"1990","unstructured":"Vavasis, S.A.: Quadratic programming is in NP. Inf. Process. Lett. 36(2), 73\u201377 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"793_CR33","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10107-015-0907-0","volume":"156","author":"Y Xia","year":"2016","unstructured":"Xia, Y., Wang, S., Sheu, R.L.: S-lemma with equality and its applications. Math. Program. 156(1\u20132), 513\u2013547 (2016)","journal-title":"Math. Program."},{"key":"793_CR34","unstructured":"Yang, B., Burer, S.: A two-variable approach to the two-trust-region subproblem. Manuscript, University of Iowa, February (2013)"},{"issue":"1","key":"793_CR35","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"Y Ye","year":"2003","unstructured":"Ye, Y., Zhang, S.: New results on quadratic minimization. SIAM J. Optim. 14(1), 245\u2013267 (2003)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"793_CR36","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-011-0466-y","volume":"129","author":"XJ Zheng","year":"2011","unstructured":"Zheng, X.J., Sun, X.L., Li, D.: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation. Math. Program. 129(2), 301\u2013329 (2011)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00793-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00793-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00793-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T23:09:22Z","timestamp":1591225762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00793-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,5]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["793"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00793-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,5]]},"assertion":[{"value":"18 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}