{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:55:09Z","timestamp":1770512109988,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T00:00:00Z","timestamp":1622073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s11075-020-01065-7","type":"journal-article","created":{"date-parts":[[2021,5,27]],"date-time":"2021-05-27T19:02:51Z","timestamp":1622142171000},"page":"993-1024","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation"],"prefix":"10.1007","volume":"88","author":[{"given":"Hezhi","family":"Luo","sequence":"first","affiliation":[]},{"given":"Sikai","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Huixian","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,27]]},"reference":[{"key":"1065_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. Global Optim. 43, 471\u2013484 (2009)","journal-title":"J. Global Optim."},{"key":"1065_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-010-0355-9","volume":"124","author":"K Anstreicher","year":"2010","unstructured":"Anstreicher, K., Burer, S.: Computable representations for convex hulls of lowdimensional quadratic forms. Math. Program. (Ser. B) 124, 33\u201343 (2010)","journal-title":"Math. Program. (Ser. B)"},{"issue":"3","key":"1065_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.orl.2012.02.001","volume":"40","author":"S Burer","year":"2012","unstructured":"Burer, S., Dong, H.: Representing quadratically constrained quadratic programs as generalized copositive programs. Oper. Res. Lett. 40(3), 203\u2013206 (2012)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"1065_CR4","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":"2","key":"1065_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 43(2), 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"1065_CR6","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.cam.2009.07.053","volume":"233","author":"R Cambini","year":"2009","unstructured":"Cambini, R., Salvi, F.: A branch and reduce approach for solving a class of low rank D.C. programs. J. Comput. Appl. Math. 233, 492\u2013501 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"1065_CR7","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.orl.2010.07.008","volume":"38","author":"R Cambini","year":"2010","unstructured":"Cambini, R., Salvi, F.: Solving a class of low rank D.C. programs via a branch and bound approach: A computational experience. Oper. Res. Lett. 38 (5), 354\u2013357 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1065_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1021509220392","volume":"117","author":"R Cambini","year":"2002","unstructured":"Cambini, R., Sodini, C.: A finite algorithm for a particular D.C. quadratic programming problem. Ann. Oper. Res. 117(1), 33\u201349 (2002)","journal-title":"Ann. Oper. Res."},{"key":"1065_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4, 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"key":"1065_CR10","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp 217\u2013270. Kluwer Academic Publishers, Amsterdam (1994)","DOI":"10.1007\/978-1-4615-2025-2_5"},{"issue":"6","key":"1065_CR11","doi-asserted-by":"publisher","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(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"1065_CR12","doi-asserted-by":"crossref","unstructured":"Gould, N.I.M., Toint, P.L.: Numerical methods for large-scale non-convex quadratic programming. In: Trends in Industrial and Applied Mathematics (Amritsar, 2001). Appl. Optim. , vol. 72, pp 149\u2013179 (2002)","DOI":"10.1007\/978-1-4613-0263-6_8"},{"key":"1065_CR13","unstructured":"Grant, M., Boyd, S., Ye, Y.: CVX: Matlab software for disciplined convex programming. avialable at http:\/\/www.stanford.edu\/boyd\/cvx"},{"key":"1065_CR14","unstructured":"IBM ILOG CPLEX: IBM ILOG CPLEX 12.3 User\u2019s manual for CPLEX 89 (2011)"},{"key":"1065_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26, 143\u2013154 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"1065_CR16","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno, H.: A cutting plane algorithm for solving bilinear programs. Math. Program. 11, 14\u201327 (1976)","journal-title":"Math. Program."},{"key":"1065_CR17","doi-asserted-by":"crossref","unstructured":"Konno, H., Kuno, T.: Multiplicative programming problems. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp 369\u2013405. Kluwer Academic Publishers, Dordrecht (1995)","DOI":"10.1007\/978-1-4615-2025-2_8"},{"issue":"3","key":"1065_CR18","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s101070050003","volume":"87","author":"HA Le Thi","year":"2000","unstructured":"Le Thi, H.A.: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. Math. Program., Ser. A 87(3), 401\u2013426 (2000)","journal-title":"Math. Program., Ser. A"},{"key":"1065_CR19","first-page":"253","volume":"11","author":"HA Le Thi","year":"1997","unstructured":"Le Thi, H.A., Pham Dinh, T.: Solving a class of linearly constrained indefinite quadratic problems by D.C. algorithms. J. Global 11, 253\u2013285 (1997)","journal-title":"J. Global"},{"key":"1065_CR20","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"HA Le Thi","year":"1998","unstructured":"Le Thi, H.A., Pham Dinh, T.: A branch and bound method via D.C. algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optim. 13, 171\u2013206 (1998)","journal-title":"J. Global Optim."},{"issue":"3","key":"1065_CR21","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-016-0436-2","volume":"67","author":"C Lu","year":"2017","unstructured":"Lu, C., Deng, Z.Z., Jin, Q.: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. J. Global Optim. 67(3), 475\u2013493 (2017)","journal-title":"J. Global Optim."},{"issue":"1","key":"1065_CR22","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-018-0142-9","volume":"11","author":"HZ Luo","year":"2019","unstructured":"Luo, H.Z., Bai, X.D., Lim, G., Peng, J.M.: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation. Math. Program. Comput. 11(1), 119\u2013171 (2019)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"1065_CR23","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/s10957-018-1416-0","volume":"180","author":"HZ Luo","year":"2019","unstructured":"Luo, H.Z., Bai, X.D., Peng, J.M.: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods. J. Optim. Theory Appl. 180(3), 964\u2013992 (2019)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1065_CR24","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"1996","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Global Optim. 9(2), 113\u2013119 (1996)","journal-title":"J. Global Optim."},{"key":"1065_CR25","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Softw. 9, 140\u2013160 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"10","key":"1065_CR26","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1287\/mnsc.28.10.1106","volume":"28","author":"F Palacios-Gomez","year":"1982","unstructured":"Palacios-Gomez, F., Lasdon, L., Enquist, M.: Nonlinear optimization by successive linear programming. Management Sci. 28(10), 1106\u20131120 (1982)","journal-title":"Management Sci."},{"issue":"1","key":"1065_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0167-6377(88)90049-1","volume":"7","author":"PM Pardalos","year":"1988","unstructured":"Pardalos, P.M., Schnitger, G.: Checking local optimality in constrained quadratic programming is NP-hard. Oper. Res. Lett. 7(1), 33\u201335 (1988)","journal-title":"Oper. Res. Lett."},{"key":"1065_CR28","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. Global Optim. 1, 15\u201322 (1991)","journal-title":"J. Global Optim."},{"issue":"2","key":"1065_CR29","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P Parrilo","year":"2003","unstructured":"Parrilo, P.: Semidefinite programming relaxations for semialgebraic problems. Math. Program. 96(2), 293\u2013320 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"1065_CR30","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10589-014-9663-y","volume":"60","author":"JM Peng","year":"2015","unstructured":"Peng, J.M., Tao, Z., Luo, H.Z., Toh, K.K.: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting. Comput. Optim. Appl. 60(1), 171\u2013198 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"1065_CR31","doi-asserted-by":"crossref","unstructured":"Pham Dinh, T., Le Thi, H.A.: Recent Advances in DC Programming and DCA. In: Transactions on Computational Intelligence XIII, pp 1\u201337. Springer, Berlin (2014)","DOI":"10.1007\/978-3-642-54455-2_1"},{"key":"1065_CR32","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-010-0371-9","volume":"124","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxation of non-convex mixed integer quadratically constrained programs: Extended formulations. Math. Program. Ser. B 124, 383\u2013411 (2010)","journal-title":"Math. Program. Ser. B"},{"key":"1065_CR33","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2011","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxation of nonconvex mixed integer quadratically constrained programs: Projected formulations. Math. Program. Ser. A 130, 359\u2013413 (2011)","journal-title":"Math. Program. Ser. A"},{"key":"1065_CR34","doi-asserted-by":"publisher","unstructured":"Shen, P.P., Huang, B.: Global algorithm for solving linear multiplicative programming problems. Optim. Lett., https:\/\/doi.org\/10.1007\/s11590-018-1378-z(2019)","DOI":"10.1007\/s11590-018-1378-z"},{"key":"1065_CR35","doi-asserted-by":"crossref","unstructured":"Sherali, H., Adams, W.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Kluwer (1998)","DOI":"10.1007\/978-1-4757-4388-3"},{"key":"1065_CR36","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"issue":"12","key":"1065_CR37","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KK Toh","year":"1999","unstructured":"Toh, K.K., Todd, M., Tutuncu, R.: SDPT3: Matlab software package for semidefinite programming. Optim. Methods Softw. 11(12), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1065_CR38","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.: A branch-and-cut algorithm for nonconvex quadratic programming with box constraints. Math. Program. 102, 559\u2013575 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"1065_CR39","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"V Vandenbussche","year":"2005","unstructured":"Vandenbussche, V., Nemhauser, G.G.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3), 531\u2013557 (2005)","journal-title":"Math. Program."},{"key":"1065_CR40","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"SA Vavasis","year":"1992","unstructured":"Vavasis, S.A.: Approximation algorithms for indefinite quadratic programming. Math. Program. 57, 279\u2013311 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"1065_CR41","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF01096414","volume":"3","author":"V Visweswaran","year":"1993","unstructured":"Visweswaran, V., Floudas, C.: New properties and computational improvement of the GOP algorithm for problems with quadratic objective function and constraints. J. Global Optim. 3(3), 439\u2013462 (1993)","journal-title":"J. Global Optim."},{"issue":"3","key":"1065_CR42","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1080\/02331934.2016.1269765","volume":"66","author":"C Wang","year":"2017","unstructured":"Wang, C., Bai, Y., Shen, P.: A practicable branch-and-bound algorithm for globally solving multiplicative programming. optimization. Optimization 66(3), 397\u2013405 (2017)","journal-title":"Optimization"},{"key":"1065_CR43","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01581726","volume":"80","author":"Y Ye","year":"1998","unstructured":"Ye, Y.: On the complexity of approximating a KKT point of quadratic programming. Math. Program. 80, 195\u2013211 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"1065_CR44","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"Y Ye","year":"1999","unstructured":"Ye, Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84(2), 219\u2013226 (1999)","journal-title":"Math. Program."},{"key":"1065_CR45","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070050006","volume":"87","author":"S Zhang","year":"2000","unstructured":"Zhang, S.: Quadratic maximization and semidefinite relaxation. Math. Program. 87, 453\u2013465 (2000)","journal-title":"Math. Program."},{"key":"1065_CR46","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/JSAC.2011.110209","volume":"29","author":"Y Zhang","year":"2011","unstructured":"Zhang, Y., So, A.-C.: Optimal spectrum sharing in mimo cognitive radio networks via semidefinite programming. IEEE J. Sel. Areas Commun. 29, 362\u2013373 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"1065_CR47","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10107-011-0466-y","volume":"129","author":"X Zheng","year":"2011","unstructured":"Zheng, X., Sun, X., Li, D.: Convex relaxations for nonconvex quadratically constrained quadratic programming: Matrix cone decomposition and polyhedral approximation. Math. Program. (Ser. B) 129, 301\u2013329 (2011)","journal-title":"Math. Program. (Ser. B)"},{"key":"1065_CR48","doi-asserted-by":"publisher","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. Global Optim. 50, 695\u2013712 (2011)","journal-title":"J. Global Optim."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01065-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11075-020-01065-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-020-01065-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T10:34:52Z","timestamp":1631529292000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11075-020-01065-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,27]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["1065"],"URL":"https:\/\/doi.org\/10.1007\/s11075-020-01065-7","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,27]]},"assertion":[{"value":"20 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}