{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T18:59:22Z","timestamp":1758049162490,"version":"3.44.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T00:00:00Z","timestamp":1745020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T00:00:00Z","timestamp":1745020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12532-025-00279-x","type":"journal-article","created":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T02:16:16Z","timestamp":1745028976000},"page":"451-503","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Globally solving concave quadratic programs via doubly nonnegative relaxation"],"prefix":"10.1007","volume":"17","author":[{"given":"Zheng","family":"Qu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyou","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchen","family":"Lou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"issue":"6","key":"279_CR1","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1057\/palgrave.jors.2601545","volume":"54","author":"B Baesens","year":"2003","unstructured":"Baesens, B., Van Gestel, T., Viaene, S., Stepanova, M., Suykens, J., Vanthienen, J.: Benchmarking state-of-the-art classification algorithms for credit scoring. J. Oper. Res. Soc. 54(6), 627\u2013635 (2003)","journal-title":"J. Oper. Res. Soc."},{"key":"279_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-1-4614-0769-0_8","volume-title":"Handbook on Semidefinite, Conic and Polynomial Optimization","author":"S Burer","year":"2012","unstructured":"Burer, S.: Copositive programming. In: Anjos, M.F., Lasserre, J.B. (eds.) Handbook on Semidefinite, Conic and Polynomial Optimization, pp. 201\u2013218. Springer, New York (2012)"},{"issue":"2","key":"279_CR3","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":"279_CR4","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 (1998)"},{"issue":"1","key":"279_CR5","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/opre.18.1.82","volume":"18","author":"AV Cabot","year":"1970","unstructured":"Cabot, A.V., Francis, R.L.: Solving certain nonconvex quadratic minimization problems by ranking the extreme points. Oper. Res. 18(1), 82\u201386 (1970)","journal-title":"Oper. Res."},{"issue":"1","key":"279_CR6","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."},{"key":"279_CR7","doi-asserted-by":"crossref","unstructured":"Fung, G.: The disputed federalist papers: SVM feature selection via concave minimization. In: Proceedings of the 2003 Conference on Diversity in Computing, pp. 42\u201346 (2003)","DOI":"10.1145\/948542.948551"},{"issue":"2","key":"279_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10898-021-01017-y","volume":"81","author":"J Gondzio","year":"2021","unstructured":"Gondzio, J., Y\u0131ld\u0131r\u0131m, E.A.: Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations. J. Glob. Optim. 81(2), 293\u2013321 (2021)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"279_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF02283688","volume":"25","author":"GM Guisewite","year":"1990","unstructured":"Guisewite, G.M., Pardalos, P.M.: Minimum concave-cost network flow problems: applications, complexity, and algorithms. Ann. Oper. Res. 25(1), 75\u201399 (1990)","journal-title":"Ann. Oper. Res."},{"key":"279_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-030-21803-4_12","volume-title":"Optimization of Complex Systems: Theory, Models, Algorithms and Applications","author":"M Hlad\u00edk","year":"2020","unstructured":"Hlad\u00edk, M., Hartman, D.: Maximization of a convex quadratic form on a polytope: Factorization and the Chebyshev norm bounds. In: Le Thi, H.A., Le, H.M., Pham Dinh, T. (eds.) Optimization of Complex Systems: Theory, Models, Algorithms and Applications, pp. 119\u2013127. Springer, Cham (2020)"},{"issue":"7","key":"279_CR11","doi-asserted-by":"publisher","first-page":"2515","DOI":"10.1007\/s11590-020-01624-w","volume":"15","author":"M Hlad\u00edk","year":"2021","unstructured":"Hlad\u00edk, M., Hartman, D., Zamani, M.: Maximization of a PSD quadratic form and factorization. Optim. Lett. 15(7), 2515\u20132528 (2021)","journal-title":"Optim. Lett."},{"key":"279_CR12","volume-title":"Handbook of Global Optimization","author":"R Horst","year":"2013","unstructured":"Horst, R., Pardalos, P.M.: Handbook of Global Optimization, vol. 2. Springer (2013)"},{"key":"279_CR13","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"2013","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches. Springer (2013)"},{"key":"279_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01442106","volume":"7","author":"SE Jacobsen","year":"1981","unstructured":"Jacobsen, S.E.: Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints. Appl. Math. Optim. 7, 1\u20139 (1981)","journal-title":"Appl. Math. Optim."},{"issue":"5","key":"279_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.fmre.2021.08.010","volume":"1","author":"X Jiao","year":"2021","unstructured":"Jiao, X., Pei, S., Sun, Z., Kang, J., Yau, S.S.T.: Determination of the nucleotide or amino acid composition of genome or protein sequences by using natural vector method and convex hull principle. Fundam. Res. 1(5), 559\u2013564 (2021)","journal-title":"Fundam. Res."},{"issue":"1","key":"279_CR16","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), 161\u2013187 (2016)","journal-title":"Math. Program."},{"issue":"1","key":"279_CR17","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(1), 14\u201327 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"279_CR18","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."},{"issue":"6","key":"279_CR19","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1007\/s11590-021-01846-6","volume":"16","author":"G Liuzzi","year":"2022","unstructured":"Liuzzi, G., Locatelli, M., Piccialli, V.: A computational study on QP problems with general linear constraints. Optim. Lett. 16(6), 1633\u20131647 (2022)","journal-title":"Optim. Lett."},{"issue":"3","key":"279_CR20","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":"4","key":"279_CR21","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.43.4.570","volume":"43","author":"OL Mangasarian","year":"1995","unstructured":"Mangasarian, O.L., Street, W.N., Wolberg, W.H.: Breast cancer diagnosis and prognosis via linear programming. Oper. Res. 43(4), 570\u2013577 (1995)","journal-title":"Oper. Res."},{"issue":"1","key":"279_CR22","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part I-convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"2","key":"279_CR23","doi-asserted-by":"publisher","first-page":"1044","DOI":"10.1109\/59.387950","volume":"10","author":"J Momoh","year":"1995","unstructured":"Momoh, J., Dias, L., Guo, S., Adapa, R.: Economic operation and planning of multi-area interconnected power systems. IEEE Trans. Power Syst. 10(2), 1044\u20131053 (1995)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1\u20133","key":"279_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Methods Softw. 9(1\u20133), 141\u2013160 (1998)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"279_CR25","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/19M1271762","volume":"31","author":"CJ Nohra","year":"2021","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs. SIAM J. Optim. 31(1), 142\u2013171 (2021)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"279_CR26","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1137\/1028106","volume":"28","author":"PM Pardalos","year":"1986","unstructured":"Pardalos, P.M., Rosen, J.B.: Methods for global concave minimization: a bibliographic survey. SIAM Rev. 28(3), 367\u2013379 (1986)","journal-title":"SIAM Rev."},{"issue":"1","key":"279_CR27","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":"4","key":"279_CR28","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1137\/17M1140844","volume":"61","author":"G Pataki","year":"2019","unstructured":"Pataki, G.: Characterizing bad semidefinite programs: normal forms and short proofs. SIAM Rev. 61(4), 839\u2013859 (2019)","journal-title":"SIAM Rev."},{"issue":"2","key":"279_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1011240309783","volume":"20","author":"M Porembski","year":"2001","unstructured":"Porembski, M.: Finitely convergent cutting planes for concave minimization. J. Glob. Optim. 20(2), 109\u2013132 (2001)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"279_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1080\/10556788.2019.1576176","volume":"35","author":"D Sun","year":"2020","unstructured":"Sun, D., Toh, K.C., Yuan, Y., Zhao, X.Y.: SDPNAL+: a Matlab software for semidefinite programming with bound constraints (version 1.0). Optim. Methods Softw. 35(1), 87\u2013115 (2020)","journal-title":"Optim. Methods Softw."},{"issue":"4","key":"279_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-020-01317-1","volume":"39","author":"M Telli","year":"2020","unstructured":"Telli, M., Bentobache, M., Mokhtari, A.: A successive linear approximation algorithm for the global minimization of a concave quadratic program. Comput. Appl. Math. 39(4), 1\u201328 (2020)","journal-title":"Comput. Appl. Math."},{"issue":"1\u20134","key":"279_CR32","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: SDPT3\u2014a Matlab software package for semidefinite programming, version 1.3. Optim. Methods Softw. 11(1\u20134), 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"279_CR33","first-page":"1437","volume":"5","author":"H Tuy","year":"1964","unstructured":"Tuy, H.: Concave programming under linear constraints. Soviet Math. 5, 1437\u20131440 (1964)","journal-title":"Soviet Math."},{"key":"279_CR34","doi-asserted-by":"crossref","unstructured":"Tuy, H.: Nonconvex quadratic programming. In: Convex Analysis and Global Optimization, pp. 337\u2013390. Springer (2016)","DOI":"10.1007\/978-3-319-31484-6_10"},{"issue":"4","key":"279_CR35","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1287\/moor.5.4.556","volume":"5","author":"N Van Thoai","year":"1980","unstructured":"Van Thoai, N., Tuy, H.: Convergent algorithms for minimizing a concave function. Math. Oper. Res. 5(4), 556\u2013566 (1980)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"279_CR36","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2(3), 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"279_CR37","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1287\/ijoc.2018.0883","volume":"32","author":"W Xia","year":"2020","unstructured":"Xia, W., Vera, J.C., Zuluaga, L.F.: Globally solving nonconvex quadratic programs via linear integer programming techniques. INFORMS J. Comput. 32(1), 40\u201356 (2020)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"279_CR38","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10898-019-00787-w","volume":"75","author":"M Zamani","year":"2019","unstructured":"Zamani, M.: A new algorithm for concave quadratic programming. J. Glob. Optim. 75(3), 655\u2013681 (2019)","journal-title":"J. Glob. Optim."},{"key":"279_CR39","unstructured":"Zhao, R., Pei, S., Yau, S.S.T.: New genome sequence detection via natural vector convex hull method. IEEE\/ACM Trans. Comput. Biol. Bioinform. (2020)"}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00279-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12532-025-00279-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-025-00279-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T13:47:57Z","timestamp":1757771277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12532-025-00279-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,19]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["279"],"URL":"https:\/\/doi.org\/10.1007\/s12532-025-00279-x","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"type":"print","value":"1867-2949"},{"type":"electronic","value":"1867-2957"}],"subject":[],"published":{"date-parts":[[2025,4,19]]},"assertion":[{"value":"15 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}