{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T17:26:23Z","timestamp":1777569983105,"version":"3.51.4"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"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,11]]},"DOI":"10.1007\/s10898-019-00787-w","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T09:02:35Z","timestamp":1560243755000},"page":"655-681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A new algorithm for concave quadratic programming"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4086-0999","authenticated-orcid":false,"given":"Moslem","family":"Zamani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"issue":"2\u20133","key":"787_CR1","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: 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":"1","key":"787_CR2","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 (2011)","journal-title":"Math. Program."},{"key":"787_CR3","unstructured":"Belotti, P.: Couenne: A User\u2019s Manual. Tech. rep., Lehigh University (2009)"},{"key":"787_CR4","doi-asserted-by":"publisher","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.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2. Siam, Philadelphia (2001)"},{"issue":"3","key":"787_CR5","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1137\/140987997","volume":"25","author":"IM Bomze","year":"2015","unstructured":"Bomze, I.M.: Copositive relaxation beats lagrangian dual bounds in quadratically and linearly constrained quadratic optimization problems. SIAM J. Optim. 25(3), 1249\u20131275 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"787_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-007-0138-0","volume":"115","author":"IM 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 (2008)","journal-title":"Math. Program."},{"key":"787_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1\u20132","key":"787_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-011-0495-6","volume":"137","author":"S Burer","year":"2013","unstructured":"Burer, S., Dong, H.: Separation and relaxation for cones of quadratic forms. Math. Program. 137(1\u20132), 343\u2013370 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"787_CR9","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."},{"key":"787_CR10","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/978-1-4613-0303-9_27","volume-title":"Handbook of Combinatorial Optimization","author":"RE Burkard","year":"1998","unstructured":"Burkard, R.E., Cela, E., Pardalos, P.M., Pitsoulis, L.S.: The quadratic assignment problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1713\u20131809. Springer, Berlin (1998)"},{"issue":"1","key":"787_CR11","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(1), 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"787_CR12","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10898-018-0665-7","volume":"72","author":"T Chuong","year":"2018","unstructured":"Chuong, T., Jeyakumar, V.: Generalized lagrangian duality for nonconvex polynomial programs with polynomial multipliers. J. Glob. Optim. 72(4), 655\u2013678 (2018)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"787_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1023\/A:1022687222060","volume":"95","author":"M D\u00fcr","year":"1997","unstructured":"D\u00fcr, M., Horst, R.: Lagrange duality and partitioning techniques in nonconvex global optimization. J. Optim. Theory Appl. 95(2), 347\u2013369 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"787_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-1-4615-2025-2_5","volume-title":"Handbook of global optimization","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A., Visweswaran, V.: Quadratic optimization. In: Horst, R., Pardalos, P.M. (eds.) Handbook of global optimization, pp. 217\u2013269. Springer, Berlin (1995)"},{"key":"787_CR15","unstructured":"Fourer, R., Gay, D., Kernighan, B.: Ampl (vol. 117). Danvers, MA: Boyd & Fraser (1993)"},{"key":"787_CR16","unstructured":"Globallib: Gamsworld. \n                    http:\/\/www.gamsworld.org\/global\/globallib.htm\n                    \n                   (2013)"},{"key":"787_CR17","unstructured":"Gondzio, J., Yildirim, E.A.: Global Solutions of Nonconvex Standard Quadratic Programs Via Mixed Integer Linear Programming Reformulations. arXiv preprint \n                    arXiv:1810.02307\n                    \n                   (2018)"},{"key":"787_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cor.2014.09.008","volume":"55","author":"A Gorge","year":"2015","unstructured":"Gorge, A., Lisser, A., Zorgati, R.: Generating cutting planes for the semidefinite relaxation of quadratic programs. Comput. Oper. Res. 55, 65\u201375 (2015)","journal-title":"Comput. Oper. Res."},{"key":"787_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer Science & Business Media, Berlin (1996)"},{"key":"787_CR20","unstructured":"ILOG, I.: Cplex 9.0 reference manual. ILOG CPLEX Division (2003)"},{"issue":"1","key":"787_CR21","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10208-015-9286-4","volume":"17","author":"B Jiang","year":"2017","unstructured":"Jiang, B., Li, Z., Zhang, S.: On cones of nonnegative quartic forms. Found. Comput. Math. 17(1), 161\u2013197 (2017)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"787_CR22","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1137\/030601260","volume":"15","author":"S Kim","year":"2005","unstructured":"Kim, S., Kojima, M., Waki, H.: Generalized lagrangian duals and sums of squares relaxations of sparse polynomial optimization problems. SIAM J. Optim. 15(3), 697\u2013719 (2005)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"787_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01580380","volume":"11","author":"H Konno","year":"1976","unstructured":"Konno, H.: Maximization of a convex quadratic function under linear constraints. Math. Program. 11(1), 117\u2013127 (1976)","journal-title":"Math. Program."},{"key":"787_CR24","volume-title":"Optimization on Low Rank Nonconvex Structures","author":"H Konno","year":"2013","unstructured":"Konno, H., Thach, P.T., Tuy, H.: Optimization on Low Rank Nonconvex Structures, vol. 15. Springer Science & Business Media, Berlin (2013)"},{"key":"787_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107447226","volume-title":"An Introduction to Polynomial and Semi-Algebraic Optimization","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B.: An Introduction to Polynomial and Semi-Algebraic Optimization, vol. 52. Cambridge University Press, Cambridge (2015)"},{"issue":"1\u20132","key":"787_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s13675-015-0050-y","volume":"5","author":"JB Lasserre","year":"2017","unstructured":"Lasserre, J.B., Toh, K.C., Yang, S.: A bounded degree sos hierarchy for polynomial optimization. EURO J. Comput. Optim. 5(1\u20132), 87\u2013117 (2017)","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"787_CR27","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10898-013-0123-5","volume":"60","author":"M Laurent","year":"2014","unstructured":"Laurent, M., Sun, Z.: Handelman\u2019s hierarchy for the maximum stable set problem. J. Glob. Optim. 60(3), 393\u2013423 (2014)","journal-title":"J. Glob. Optim."},{"key":"787_CR28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972672","volume-title":"Global Optimization: Theory, Algorithms, and Applications","author":"M Locatelli","year":"2013","unstructured":"Locatelli, M., Schoen, F.: Global Optimization: Theory, Algorithms, and Applications, vol. 15. Siam, Philadelphia (2013)"},{"issue":"2","key":"787_CR29","doi-asserted-by":"publisher","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\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"issue":"10","key":"787_CR30","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1109\/9.256366","volume":"37","author":"DG Luenberger","year":"1992","unstructured":"Luenberger, D.G.: A double look at duality. IEEE Trans. Autom. Control 37(10), 1474\u20131482 (1992)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"787_CR31","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."},{"key":"787_CR32","volume-title":"Nonlinear Programming","author":"OL Mangasarian","year":"1974","unstructured":"Mangasarian, O.L.: Nonlinear Programming. Siam, Philadelphia (1974)"},{"key":"787_CR33","unstructured":"MOSEK, A.: The mosek optimization toolbox for matlab manual. version 8.1. \n                    http:\/\/docs.mosek.com\/8.1\/toolbox\/index.html\n                    \n                   (2017)"},{"key":"787_CR34","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-1-4615-4381-7_13","volume-title":"Handbook of Semidefinite Programming","author":"Y Nesterov","year":"2000","unstructured":"Nesterov, Y., Wolkowicz, H., Ye, Y.: Semidefinite programming relaxations of nonconvex quadratic optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, pp. 361\u2013419. Springer, Berlin (2000)"},{"issue":"1\u20132","key":"787_CR35","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10107-013-0680-x","volume":"146","author":"J Nie","year":"2014","unstructured":"Nie, J.: Optimality conditions and finite convergence of lasserre\u2019s hierarchy. Math. Program. 146(1\u20132), 97\u2013121 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"787_CR36","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."},{"issue":"3","key":"787_CR37","doi-asserted-by":"publisher","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(3), 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"787_CR38","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812","volume-title":"A Mathematical View of Interior-Point Methods in Convex Optimization","author":"J Renegar","year":"2001","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization, vol. 3. Siam, Philadelphia (2001)"},{"key":"787_CR39","unstructured":"Sahinidis, N.V., Tawarmalani, M.: Baron 18.11.12: Global optimization of mixed-integer nonlinear programs. User\u2019s manual (2017)"},{"issue":"4","key":"787_CR40","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Comput. 3(4), 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"787_CR41","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"HD Sherali","year":"1992","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Glob. Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"787_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic programming problems. J. Glob. Optim. 7(1), 1\u201331 (1995)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"787_CR43","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"NZ Shor","year":"1990","unstructured":"Shor, N.Z.: Dual quadratic estimates in polynomial and boolean programming. Ann. Oper. Res. 25(1), 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"787_CR44","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10898-011-9766-2","volume":"52","author":"J Sponsel","year":"2012","unstructured":"Sponsel, J., Bundfuss, S., D\u00fcr, M.: An improved algorithm to test copositivity. J. Glob. Optim. 52(3), 537\u2013551 (2012)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"787_CR45","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."},{"key":"787_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31484-6","volume-title":"Convex Analysis and Global Optimization (Springer Optimization and Its Applications Book 110)","author":"H Tuy","year":"2016","unstructured":"Tuy, H.: Convex Analysis and Global Optimization (Springer Optimization and Its Applications Book 110). Springer, Berlin (2016)"},{"key":"787_CR47","unstructured":"Xia, W., Vera, J., Zuluaga, L.F.: Globally solving non-convex quadratic programs via linear integer programming techniques. arXiv preprint \n                    arXiv:1511.02423\n                    \n                   (2015)"},{"key":"787_CR48","unstructured":"Zamani, M.: New bounds for nonconvex quadratically constrained quadratic programming. arXiv preprint \n                    arXiv:1902.08861\n                    \n                   (2019)"},{"issue":"2","key":"787_CR49","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10898-011-9660-y","volume":"52","author":"X Zheng","year":"2012","unstructured":"Zheng, X., Sun, X., Li, D., Xu, Y.: On zero duality gap in nonconvex quadratic programming problems. J. Glob. Optim. 52(2), 229\u2013242 (2012)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00787-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-019-00787-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-019-00787-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T23:13:45Z","timestamp":1591744425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-019-00787-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,11]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["787"],"URL":"https:\/\/doi.org\/10.1007\/s10898-019-00787-w","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,11]]},"assertion":[{"value":"24 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}