{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T22:33:38Z","timestamp":1769466818711,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T00:00:00Z","timestamp":1684195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T00:00:00Z","timestamp":1684195200000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10589-023-00485-0","type":"journal-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T09:02:24Z","timestamp":1684227744000},"page":"199-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints"],"prefix":"10.1007","volume":"86","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9385-5697","authenticated-orcid":false,"given":"Hezhi","family":"Luo","sequence":"first","affiliation":[]},{"given":"Xianye","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Huixian","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Weiqiang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,16]]},"reference":[{"key":"485_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s101079900106","volume":"87","author":"C Audet","year":"2000","unstructured":"Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87, 131\u2013152 (2000)","journal-title":"Math. Program."},{"key":"485_CR2","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., Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143, 1\u201329 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"485_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02592331","volume":"72","author":"A Ben-Tal","year":"1995","unstructured":"Ben-Tal, A., Teboulle, M.: Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Program. 72(1), 51\u201363 (1995)","journal-title":"Math. Program."},{"key":"485_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1287\/mnsc.27.4.431","volume":"27","author":"G Bitran","year":"1981","unstructured":"Bitran, G., Hax, A.A.: Disaggregation and resource allocation using convex knapsack problems with bounded variables. Manage. Sci. 27, 431\u2013441 (1981)","journal-title":"Manage. Sci."},{"key":"485_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0167-6377(96)00039-9","volume":"20","author":"K Bretthauer","year":"1997","unstructured":"Bretthauer, K., Shetty, B.: Quadratic resource allocation with generalized upper bounds. Oper. Res. Lett. 20, 51\u201357 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"11","key":"485_CR6","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1287\/mnsc.1100.1235","volume":"56","author":"DB Brown","year":"2010","unstructured":"Brown, D.B., Carlin, B., Lobo, M.S.: Optimal portfolio liquidation with distress risk. Manag. Sci. 56(11), 1997\u20132014 (2010)","journal-title":"Manag. Sci."},{"issue":"2","key":"485_CR7","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":"485_CR8","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."},{"issue":"5","key":"485_CR9","doi-asserted-by":"publisher","first-page":"2235","DOI":"10.1111\/j.1540-6261.2007.01274.x","volume":"62","author":"BI Carlin","year":"2007","unstructured":"Carlin, B.I., Lobo, M.S., Viswanathan, S.: Episodic liquidity crises: cooperative and predatory trading. J. Finance 62(5), 2235\u20132274 (2007)","journal-title":"J. Finance"},{"key":"485_CR10","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":"485_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/j.ejor.2014.12.034","volume":"244","author":"JN Chen","year":"2015","unstructured":"Chen, J.N., Feng, L.M., Peng, J.M.: Optimal deleveraging with nonlinear temporary price impact. Eur. J. Oper. Res. 244, 240\u2013247 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"485_CR12","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1287\/opre.2013.1222","volume":"62","author":"JN Chen","year":"2014","unstructured":"Chen, J.N., Feng, L.M., Peng, J.M., Ye, Y.Y.: Analytical results and efficient algorithm for optimal portfolio deleveraging with market impact. Oper. Res. 62(1), 195\u2013206 (2014)","journal-title":"Oper. Res."},{"key":"485_CR13","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/moor.19.1.94","volume":"19","author":"S Cosares","year":"1994","unstructured":"Cosares, S., Hochbaum, D.: Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Math. Oper. Res. 19, 94\u2013111 (1994)","journal-title":"Math. Oper. Res."},{"key":"485_CR14","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s11590-011-0288-0","volume":"6","author":"A De Waegenaere","year":"2012","unstructured":"De Waegenaere, A., Wielhouwer, J.L.: A breakpoint search approach for convex resource allocation problems with bounded variables. Optim. Lett. 6, 629\u2013640 (2012)","journal-title":"Optim. Lett."},{"issue":"1","key":"485_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10589-021-00289-0","volume":"80","author":"XD Ding","year":"2021","unstructured":"Ding, X.D., Luo, H.Z., Wu, H.X., Liu, J.Z.: An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation. Comput. Optim. Appl. 80(1), 89\u2013120 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"485_CR16","unstructured":"Gurobi Optimizer.: Gurobi Interactive Shell (win64), Version 9.0.2 Copyright (c), Gurobi Optimization, LLC (2020)"},{"key":"485_CR17","unstructured":"IBM ILOG CPLEX.: IBM ILOG CPLEX 12.3 User\u2019s Manual for CPLEX, 89 (2011)"},{"key":"485_CR18","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1080\/10556788.2017.1350178","volume":"33","author":"M Kilinc","year":"2018","unstructured":"Kilinc, M., Sahinidis, N.V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems in BARON. Optim. Methods Softw. 33, 540\u2013562 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"485_CR19","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10107-006-0050-z","volume":"112","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math. Program. 112(2), 473\u2013491 (2008)","journal-title":"Math. Program."},{"key":"485_CR20","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, 251\u2013282 (2005)","journal-title":"Math. Program."},{"key":"485_CR21","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/BFb0120986","volume":"19","author":"P Loridan","year":"1982","unstructured":"Loridan, P.: Necessary conditions for $$\\epsilon $$-optimality. Math. Program. Stud. 19, 140\u2013152 (1982)","journal-title":"Math. Program. Stud."},{"issue":"1","key":"485_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":"2","key":"485_CR23","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1007\/s11075-020-01065-7","volume":"88","author":"HZ Luo","year":"2021","unstructured":"Luo, H.Z., Chen, S.K., Wu, H.X.: A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation. Numer. Algorithms 88(2), 993\u20131024 (2021)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"485_CR24","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/ijoc.2019.0941","volume":"33","author":"HZ Luo","year":"2021","unstructured":"Luo, H.Z., Ding, X.D., Peng, J.M., Jiang, R.J., Li, D.: Complexity results and effective algorithms for the worst-case linear optimization under uncertainties. INFORMS J. Comput. 33(1), 180\u2013197 (2021)","journal-title":"INFORMS J. Comput."},{"key":"485_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01588800","volume":"49","author":"JJ Mor\u00e9","year":"1991","unstructured":"Mor\u00e9, J.J., Vavasis, S.A.: On the solution of concave knapsack problems. Math. Program. 49, 397\u2013411 (1991)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"485_CR26","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."},{"key":"485_CR27","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1287\/ijoc.4.2.166","volume":"4","author":"S Nielsen","year":"1992","unstructured":"Nielsen, S., Zenios, S.: Massively parallel algorithms for singly constrained convex programs. ORSA J. Comput. 4, 166\u2013181 (1992)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"485_CR28","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF01585748","volume":"46","author":"PM Pardalos","year":"1990","unstructured":"Pardalos, P.M., Kovoor, N.: An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Program. 46(1), 321\u2013328 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"485_CR29","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I Polik","year":"2007","unstructured":"Polik, I., Terlaky, T.: A survey of the S-lemma. SIAM Rev. 49(3), 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"key":"485_CR30","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, 262\u2013279 (1974)","journal-title":"SIAM J. Comput."},{"key":"485_CR31","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1057\/jors.1990.121","volume":"41","author":"B Shetty","year":"1990","unstructured":"Shetty, B., Muthukrishnan, R.: A parallel projection for the multicommodity network model. J. Oper. Res. Soc. 41, 837\u2013842 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"485_CR32","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1002\/net.3230210407","volume":"21","author":"J Ventura","year":"1991","unstructured":"Ventura, J.: Computational development of a Lagrangian dual approach for quadratic networks. Networks 21, 469\u2013485 (1991)","journal-title":"Networks"},{"issue":"2","key":"485_CR33","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."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00485-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00485-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00485-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T11:14:59Z","timestamp":1690283699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00485-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,16]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["485"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00485-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,16]]},"assertion":[{"value":"29 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2023","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 confirm that all data generated or analysed during this study are included in this published article. All the data used in Sect.\u00a0 can be downloaded at .","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}