{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:50Z","timestamp":1740122690407,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T00:00:00Z","timestamp":1469491200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11371255","11001180"],"award-info":[{"award-number":["11371255","11001180"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11371255"],"award-info":[{"award-number":["11371255"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Program for Liaoning Excellent Talents in University","award":["LR2015047"],"award-info":[{"award-number":["LR2015047"]}]},{"name":"Scientific Research Foundation for the Returned Overseas Chinese Scholars","award":["JYB201302"],"award-info":[{"award-number":["JYB201302"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s10589-016-9863-8","type":"journal-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T13:39:49Z","timestamp":1469540389000},"page":"309-326","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast algorithm for singly linearly constrained quadratic programs with box-like constraints"],"prefix":"10.1007","volume":"66","author":[{"given":"Meijiao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yong-Jin","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,26]]},"reference":[{"key":"9863_CR1","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1137\/S0036144503423264","volume":"46","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Diaconis, P., Xiao, L.: Fastest mixing Markov chain on a graph. SIAM Rev. 46, 667\u2013689 (2004)","journal-title":"SIAM Rev."},{"key":"9863_CR2","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1137\/070689413","volume":"20","author":"S Boyd","year":"2009","unstructured":"Boyd, S., Diaconis, P., Parrilo, P.A., Xiao, L.: Fastest mixing Markov chain on graphs with symmetries. SIAM J. Optim. 20, 792\u2013819 (2009)","journal-title":"SIAM J. Optim."},{"key":"9863_CR3","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/mnsc.27.4.431","volume":"27","author":"GR Bitran","year":"1981","unstructured":"Bitran, G.R., Hax, A.C.: Disaggregation and resource allocation using convex knapsack problems with bounded variables. Manag. Sci. 27, 431\u2013441 (1981)","journal-title":"Manag. Sci."},{"key":"9863_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P Brucker","year":"1984","unstructured":"Brucker, P.: An $$O(n)$$ O ( n ) algorithm for quadratic knapsack problems. Oper. Res. Lett. 3, 163\u2013166 (1984)","journal-title":"Oper. Res. Lett."},{"key":"9863_CR5","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1137\/0724092","volume":"24","author":"PH Calamai","year":"1987","unstructured":"Calamai, P.H., Mor\u00e9, J.J.: Quasi-Newton updates with bounds. SIAM J. Numer. Anal. 24, 1434\u20131441 (1987)","journal-title":"SIAM J. Numer. Anal."},{"key":"9863_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s12532-014-0066-y","volume":"6","author":"R Cominetti","year":"2014","unstructured":"Cominetti, R., Mascarenhas, W.F., Silva, P.J.S.: A Newtons method for the continuous quadratic knapsack problem. Math. Progr. Comput. 6, 151\u2013169 (2014)","journal-title":"Math. Progr. Comput."},{"key":"9863_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/moor.19.1.94","volume":"19","author":"S Cosares","year":"1994","unstructured":"Cosares, S., Hochbaum, D.S.: 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":"9863_CR8","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Progr. 106, 403\u2013421 (2006)","journal-title":"Math. Progr."},{"issue":"3","key":"9863_CR9","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/1024074.1024080","volume":"30","author":"TA Davis","year":"2004","unstructured":"Davis, T.A., Hager, W.W., Hungerford, J.T.: An efficient hybrid algorithm for the separable convex quadratic knapsack problem. ACM Trans. Math. Softw. 30(3), 377\u2013380 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"9863_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10107-012-0619-7","volume":"144","author":"C Ding","year":"2014","unstructured":"Ding, C., Sun, D.F., Toh, K.-C.: An introduction to a class of matrix cone programming. Math. Progr. 144, 141\u2013179 (2014)","journal-title":"Math. Progr."},{"key":"9863_CR11","unstructured":"Gurobi Optimization, Inc., Gurobi Optimizer Reference Manual, http:\/\/www.gurobi.com (2015)"},{"key":"9863_CR12","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01588328","volume":"18","author":"R Helgason","year":"1980","unstructured":"Helgason, R., Kennington, J., Lall, H.: A polynomially bounded algorithm for a singly constrained quadratic program. Math. Progr. 18, 338\u2013343 (1980)","journal-title":"Math. Progr."},{"key":"9863_CR13","first-page":"269","volume":"69","author":"DS Hochbaum","year":"1995","unstructured":"Hochbaum, D.S., Hong, S.-P.: About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Math. Progr. 69, 269\u2013309 (1995)","journal-title":"Math. Progr."},{"key":"9863_CR14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10957-007-9259-0","volume":"134","author":"KC Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: On linear-time algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 134, 549\u2013554 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"9863_CR15","doi-asserted-by":"crossref","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. Progr. 112, 473\u2013491 (2008)","journal-title":"Math. Progr."},{"key":"9863_CR16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10957-007-9317-7","volume":"136","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel, K.C.: Variable fixing algorithms for the continuous quadratic knapsack problem. J. Optim. Theory Appl. 136, 445\u2013458 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"9863_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.orl.2013.01.014","volume":"41","author":"Y-J Liu","year":"2013","unstructured":"Liu, Y.-J., Wang, S.Y., Sun, J.H.: Finding the projection onto the intersection of a closed half-space and a variable box. Oper. Res. Lett. 41, 259\u2013264 (2013)","journal-title":"Oper. Res. Lett."},{"key":"9863_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1023\/A:1023997605430","volume":"117","author":"N Maculan","year":"2003","unstructured":"Maculan, N., Santiago, C.P., Macambira, E.M., Jardim, M.H.C.: An $$O(n)$$ O ( n ) algorithm for projecting a vector on the intersection of a hyperplane and a box in $$\\mathbb{R}^n$$ R n . J. Optim. Theory Appl. 117, 553\u2013574 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"9863_CR19","first-page":"238","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: D\u00e9composition orthogonale d\u2019un espace hibertien selon deux cones mutuellement polaires. C. R. Acad. Sci. 255, 238\u2013240 (1962)","journal-title":"C. R. Acad. Sci."},{"key":"9863_CR20","unstructured":"MOSEK ApS, The MOSEK Optimization Toolbox for MATLAB Manual. Version 7.1 (Revision 28), http:\/\/docs.mosek.com\/7.1\/toolbox\/index.html (2015)"},{"key":"9863_CR21","doi-asserted-by":"crossref","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. Progr. 46, 321\u2013328 (1990)","journal-title":"Math. Progr."},{"key":"9863_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01581193","volume":"55","author":"AG Robinson","year":"1992","unstructured":"Robinson, A.G., Jiang, N., Lerme, C.S.: On the continuous quadratic knapsack problem. Math. Progr. 55, 99\u2013108 (1992)","journal-title":"Math. Progr."},{"key":"9863_CR23","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/110827144","volume":"24","author":"B Wu","year":"2014","unstructured":"Wu, B., Ding, C., Sun, D.F., Toh, K.-C.: On the Moreau\u2013Yoshida regularization of the vector $$k$$ k -norm related functions. SIAM J. Optim. 24, 766\u2013794 (2014)","journal-title":"SIAM J. Optim."},{"key":"9863_CR24","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/B978-0-12-775850-3.50013-3","volume-title":"Contributions to Nonlinear Functional Analysis","author":"EH Zarantonello","year":"1971","unstructured":"Zarantonello, E.H.: Projections on convex sets in Hilbert space and spectral theory I and II. In: Zarantonello, E.H. (ed.) Contributions to Nonlinear Functional Analysis, pp. 237\u2013424. Academic Press, New York (1971)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9863-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9863-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9863-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9863-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:13:56Z","timestamp":1498317236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9863-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,26]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["9863"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9863-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,7,26]]}}}