{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T12:10:11Z","timestamp":1759839011755,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T00:00:00Z","timestamp":1465430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T00:00:00Z","timestamp":1465430400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11171177","11371216"],"award-info":[{"award-number":["11171177","11371216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571029"],"award-info":[{"award-number":["11571029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of Chin","doi-asserted-by":"publisher","award":["11526186"],"award-info":[{"award-number":["11526186"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10589-016-9855-8","type":"journal-article","created":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T08:35:48Z","timestamp":1465461348000},"page":"97-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Conic approximation to quadratic optimization with linear complementarity constraints"],"prefix":"10.1007","volume":"66","author":[{"given":"Jing","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Shu-Cherng","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Wenxun","family":"Xing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,9]]},"reference":[{"issue":"3","key":"9855_CR1","first-page":"437","volume":"10","author":"N Arima","year":"2013","unstructured":"Arima, N., Kim, S., Kojima, M.: Simplified copositive and lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables. Pac. J. Optim. 10(3), 437\u2013451 (2013)","journal-title":"Pac. J. Optim."},{"issue":"3","key":"9855_CR2","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s10589-012-9497-4","volume":"54","author":"L Bai","year":"2013","unstructured":"Bai, L., Mitchell, J.E., Pang, J.S.: On convex quadratic programs with linear complementarity constraints. Comput. Optim. Appl. 54(3), 517\u2013554 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9855_CR3","doi-asserted-by":"crossref","unstructured":"Bai, L., Mitchell, J.E., Pang, J.S.: On conic QPCCs, conic QCQPs and completely positive programs. Math. Program. Ser. A (2015)","DOI":"10.1007\/s10107-015-0951-9"},{"key":"9855_CR4","unstructured":"Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report (1998)"},{"key":"9855_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications. MPS\/SIAM Series on Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization, Analysis, Algorithms and Engineering Applications. MPS\/SIAM Series on Optimization, 1st edn. SIAM, Philadelphia (2001)","edition":"1"},{"issue":"1","key":"9855_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., Elloumi, S.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109(1), 55\u201368 (2007)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"9855_CR7","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s10107-012-0534-y","volume":"141","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., Wiegele, A.: Semidefinite relaxations for non-convex quadratic mixed-integer programming. Math. Program. 141(1\u20132), 435\u2013452 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"9855_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program. 120(2), 479\u2013495 (2009)","journal-title":"Math. Program."},{"issue":"1","key":"9855_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-010-0010-8","volume":"2","author":"S Burer","year":"2010","unstructured":"Burer, S.: Optimizing a polyhedral-semidefinite relaxation of completely positive programs. Math. Prog. Comput. 2(1), 1\u201319 (2010)","journal-title":"Math. Prog. Comput."},{"key":"9855_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-015-0888-z","volume":"151","author":"S Burer","year":"2015","unstructured":"Burer, S.: A gentle, geometric introduction to copositive optimization. Math. Program. Ser. B 151, 89\u2013116 (2015)","journal-title":"Math. Program. Ser. B"},{"issue":"2","key":"9855_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s11228-009-0112-5","volume":"17","author":"X Chen","year":"2009","unstructured":"Chen, X., Ye, J.J.: A class of quadratic programs with linear complementarity constraints. Set-Valued Var. Anal. 17(2), 113\u2013133 (2009)","journal-title":"Set-Valued Var. Anal."},{"issue":"3","key":"9855_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1080\/10556788.2010.544308","volume":"27","author":"A Engau","year":"2012","unstructured":"Engau, A., Anjos, M., Vannelli, A.: On handling cutting planes in interior-point methods for solving semidefinite relaxations of binary quadratic optimization problems. Optim. Methods Softw. 27(3), 539\u2013559 (2012)","journal-title":"Optim. Methods Softw."},{"key":"9855_CR13","volume-title":"Linear Conic Optimization","author":"S-C Fang","year":"2013","unstructured":"Fang, S.-C., Xing, W.: Linear Conic Optimization. Science Press, Beijing (2013)"},{"key":"9855_CR14","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1137\/S0036144595285963","volume":"39","author":"MC Ferris","year":"1997","unstructured":"Ferris, M.C., Pang, J.S.: Engineering and economic applications of complementarity problems. SIAM Rev. 39, 669\u2013713 (1997)","journal-title":"SIAM Rev."},{"key":"9855_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M.: Handbook of Test Problems in Local and Global Optimization, 1st edn. Springer, Dordrecht (1999)","edition":"1"},{"issue":"1","key":"9855_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10479-008-0481-4","volume":"188","author":"B Ghaddar","year":"2007","unstructured":"Ghaddar, B., Anjos, M.F., Liers, F.: A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem. Ann. Oper. Res. 188(1), 155\u2013174 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9855_CR17","unstructured":"Grant, M., Boyed, S.: CVX: Matlab software for disciplined convex programming, version 2.0(beta), \n                    http:\/\/cvxr.com\/cvx\n                    \n                   (2013)"},{"issue":"1","key":"9855_CR18","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/07068463x","volume":"19","author":"J Hu","year":"2008","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Bennett, K.P., Kunapuli, G.: On the global solution of linear programs with linear complementarity constraints. SIAM J. Optim. 19(1), 445\u2013471 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9855_CR19","first-page":"125","volume":"10","author":"JJ J\u00fadice","year":"2002","unstructured":"J\u00fadice, J.J., Faustino, A.M., Ribeiro, I.M.: On the solution of NP-hard linear complementarity problems. Sociedad de Estad\u00edstica e Investigaci\u00f3n Operativa TOP 10(1), 125\u2013145 (2002)","journal-title":"Sociedad de Estad\u00edstica e Investigaci\u00f3n Operativa TOP"},{"issue":"1","key":"9855_CR20","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-011-0228-2","volume":"20","author":"JJ J\u00fadice","year":"2012","unstructured":"J\u00fadice, J.J.: Algorithms for linear programming with linear complementarity constraints. TOP 20(1), 4\u201325 (2012)","journal-title":"TOP"},{"issue":"2","key":"9855_CR21","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/100802487","volume":"23","author":"C Kanzow","year":"2013","unstructured":"Kanzow, C., Schwartz, A.: A new regularization method for mathematical programs with complementarity constraints with strong convengence properities. SIAM J. Optim. 23(2), 770\u2013798 (2013)","journal-title":"SIAM J. Optim."},{"key":"9855_CR22","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., Kanzow, C., Schwartz, A.: A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. Ser. A 156, 161\u2013187 (2016)","journal-title":"Math. Program. Ser. A"},{"issue":"1","key":"9855_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/040621065","volume":"17","author":"S Leyffer","year":"2006","unstructured":"Leyffer, S., L\u00f3pez-Calva, G., Nocedal, J.: Interior methods for mathematical programs with complementarity constraints. SIAM J. Optim. 17(1), 52\u201377 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9855_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0377-0427(02)00419-3","volume":"146","author":"GS Liu","year":"2002","unstructured":"Liu, G.S., Zhang, J.Z.: A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints. J. Comput. Appl. Math. 146(1), 77\u201387 (2002)","journal-title":"J. Comput. Appl. Math."},{"key":"9855_CR25","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1080\/02331934.2014.895899","volume":"64","author":"C Lu","year":"2014","unstructured":"Lu, C., Jin, Q., Fang, S.-C., Wang, Z., Xing, W.: Adaptive computable approximation to cones of nonnegative quadratic functions. Optimization 64, 955\u2013980 (2014)","journal-title":"Optimization"},{"issue":"3","key":"9855_CR26","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s11590-014-0768-0","volume":"9","author":"C Lu","year":"2014","unstructured":"Lu, C., Guo, X.: Convex reformulation for binary quadratic programming problems via average objective value maximization. Optim. Lett. 9(3), 523\u2013535 (2014)","journal-title":"Optim. Lett."},{"key":"9855_CR27","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., Mancho So, A., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. IEEE Signal Process. Mag. 27, 20\u201334 (2010)","journal-title":"IEEE Signal Process. Mag."},{"key":"9855_CR28","volume-title":"Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Modeling and Optimization: Theory and Applications","author":"JE Mitchell","year":"2012","unstructured":"Mitchell, J.E., Pang, J.S., Yu, B.: Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints, Modeling and Optimization: Theory and Applications. Springer, New York (2012)"},{"key":"9855_CR29","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"KG Murty","year":"1987","unstructured":"Murty, K.G., Kabadi, S.N.: Some NP-complete problems in quadratic and nonlinear programming. Math. Program. 39, 117\u2013129 (1987)","journal-title":"Math. Program."},{"key":"9855_CR30","unstructured":"Rinaldi, G.: Rudy, \n                    http:\/\/www-user.tu-chemnitz.de\/~helmberg\/rudy.tar.gz\n                    \n                   (1998)"},{"issue":"1\u20132","key":"9855_CR31","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 relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1\u20132), 383\u2013411 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"9855_CR32","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 relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130(2), 359\u2013413 (2011)","journal-title":"Math. Program."},{"key":"9855_CR33","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, 246\u2013267 (2003)","journal-title":"Math. Oper. Res."},{"key":"9855_CR34","doi-asserted-by":"publisher","first-page":"703","DOI":"10.3934\/jimo.2013.9.701","volume":"9","author":"Y Tian","year":"2013","unstructured":"Tian, Y., Fang, S.-C., Deng, Z., Xing, W.: Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming. J. Ind. Manag. Optim. 9, 703\u2013721 (2013)","journal-title":"J. Ind. Manag. Optim."},{"key":"9855_CR35","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0167-6377(01)00093-1","volume":"29","author":"L Tuncel","year":"2001","unstructured":"Tuncel, L.: On the Slater condition for the SDP relaxations of nonconvex sets. Oper. Res. Lett. 29, 181\u2013186 (2001)","journal-title":"Oper. Res. Lett."},{"key":"9855_CR36","unstructured":"Wiegele A.: Biq Mac Library, \n                    http:\/\/biqmac.uni-klu.ac.at\/biqmaclib.html\n                    \n                   (2007)"},{"key":"9855_CR37","doi-asserted-by":"publisher","first-page":"531","DOI":"10.3934\/jimo.2013.9.531","volume":"9","author":"J Zhou","year":"2013","unstructured":"Zhou, J., Chen, D., Wang, Z., Xing, W.: A conic approximation method for the 0\u20131 quadratic knapsack problem. J. Ind. Manag. Optim. 9, 531\u2013547 (2013)","journal-title":"J. Ind. Manag. Optim."},{"issue":"3","key":"9855_CR38","first-page":"593","volume":"10","author":"J Zhou","year":"2014","unstructured":"Zhou, J., Deng, Z., Fang, S.-C., Xing, W.: Detection of a copositive matrix over a $$p$$-th order cone. Pac. J. Optim. 10(3), 593\u2013611 (2014)","journal-title":"Pac. J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9855-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-016-9855-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-9855-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-016-9855-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T10:54:28Z","timestamp":1589712868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-016-9855-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,9]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9855"],"URL":"https:\/\/doi.org\/10.1007\/s10589-016-9855-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2016,6,9]]},"assertion":[{"value":"10 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 June 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}