{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T04:27:11Z","timestamp":1774499231481,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030218027","type":"print"},{"value":"9783030218034","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_22","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"213-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6610-6778","authenticated-orcid":false,"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,15]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Anstreicher, K.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Global Optim. 43(2\u20133), 471\u2013484 (2009)","DOI":"10.1007\/s10898-008-9372-0"},{"issue":"1","key":"22_CR2","doi-asserted-by":"crossref","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":"22_CR3","doi-asserted-by":"crossref","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 Algebr. Its Appl. 301(1\u20133), 121\u2013136 (1999)","journal-title":"Linear Algebr. Its Appl."},{"issue":"1","key":"22_CR4","doi-asserted-by":"crossref","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":"3","key":"22_CR5","doi-asserted-by":"crossref","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","key":"22_CR6","doi-asserted-by":"crossref","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":"22_CR7","doi-asserted-by":"crossref","unstructured":"Burer, S., Saxena, A.: The MILP road to MIQCP. In: Mixed Integer Nonlinear Programming, pp. 373\u2013405. Springer (2012)","DOI":"10.1007\/978-1-4614-1927-3_13"},{"issue":"2","key":"22_CR8","doi-asserted-by":"crossref","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":"22_CR9","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":"22_CR10","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":"6","key":"22_CR11","doi-asserted-by":"crossref","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":"22_CR12","unstructured":"Jiang, R., Li, D.: Convex relaxations with second order cone constraints for nonconvex quadratically constrained quadratic programming (2016)"},{"issue":"2","key":"22_CR13","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(2), 251\u2013282 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"22_CR14","doi-asserted-by":"crossref","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. Global Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Global Optim."},{"key":"22_CR15","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems, vol.\u00a031. Springer Science & Business Media (2013)"},{"issue":"6","key":"22_CR16","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":"22_CR17","doi-asserted-by":"crossref","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":"22_CR18","doi-asserted-by":"crossref","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","key":"22_CR19","doi-asserted-by":"crossref","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."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:39:12Z","timestamp":1572586752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_22","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}