{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:29Z","timestamp":1740122429059,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T00:00:00Z","timestamp":1611705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T00:00:00Z","timestamp":1611705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0856605","0900065"],"award-info":[{"award-number":["0856605","0900065"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1234897","1235236"],"award-info":[{"award-number":["1234897","1235236"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s10898-020-00979-9","type":"journal-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T06:02:52Z","timestamp":1611727372000},"page":"249-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Convexification techniques for linear complementarity constraints"],"prefix":"10.1007","volume":"80","author":[{"given":"Trang T.","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Jean-Philippe P.","family":"Richard","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Tawarmalani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,27]]},"reference":[{"key":"979_CR1","volume-title":"Infinite Dimensional Analysis","author":"CD Aliprantis","year":"2006","unstructured":"Aliprantis, C.D., Border, K.C.: Infinite Dimensional Analysis, 3rd edn. Springer, Berlin (2006)","edition":"3"},{"key":"979_CR2","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/040606855","volume":"16","author":"M Anitescu","year":"2005","unstructured":"Anitescu, M.: Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints. SIAM J. Optim. 16, 120\u2013145 (2005)","journal-title":"SIAM J. Optim."},{"key":"979_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E Balas","year":"1971","unstructured":"Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Oper. Res. 19, 19\u201339 (1971)","journal-title":"Oper. Res."},{"key":"979_CR4","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Discrete Math. 6, 466\u2013486 (1985)","journal-title":"SIAM J. Discrete Math."},{"key":"979_CR5","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89, 3\u201344 (1998), original manuscript was published as a technical report in 1974","DOI":"10.1016\/S0166-218X(98)00136-X"},{"key":"979_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed $$0\\text{- }1$$ programs. Math. Program. 58, 295\u2013324 (1993)","journal-title":"Math. Program."},{"key":"979_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley-Interscience, Hoboken, NJ (2006)","edition":"3"},{"key":"979_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10589-005-3908-8","volume":"34","author":"H Benson","year":"2006","unstructured":"Benson, H., Sen, A., Shanno, D.F., Vanderbei, R.V.D.: Interior-point algorithms, penalty methods and equilibrium problems. Comput. Optim. Appl. 34, 155\u2013182 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"979_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-scale nonlinear optimization","author":"R Byrd","year":"2006","unstructured":"Byrd, R., Nocedal, J., Waltz, R.: An integrated package for nonlinear optimization. In: Pillo, G.D., Roma, M. (eds.) Large-scale nonlinear optimization, pp. 35\u201360. Springer, Berlin (2006)"},{"key":"979_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1287\/moor.26.1.19.10593","volume":"26","author":"W Cook","year":"2001","unstructured":"Cook, W., Dash, S.: On the matrix-cut rank of polyhedra. Math. Oper. Res. 26, 19\u201330 (2001)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"979_CR11","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1137\/16M1066166","volume":"27","author":"D Davarnia","year":"2017","unstructured":"Davarnia, D., Richard, J.P.P., Tawarmalani, M.: Simultaneous convexification of bilinear functions over polytopes with application to network interdiction. SIAM J. Optim. 27(3), 1801\u20131833 (2017)","journal-title":"SIAM J. Optim."},{"key":"979_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1287\/moor.27.1.210.335","volume":"27","author":"IR de Farias","year":"2002","unstructured":"de Farias, I.R., Johnson, E.L., Nemhauser, G.L.: Facets of the complementarity knapsack polytope. Math. Oper. Res. 27, 210\u2013226 (2002)","journal-title":"Math. Oper. Res."},{"key":"979_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1080\/10556789508805606","volume":"5","author":"SP Dirkse","year":"1995","unstructured":"Dirkse, S.P., Ferris, M.C.: The PATH solver: a non-monotone stabilization scheme for mixed complementarity problems. Optim. Methods Softw. 5, 123\u2013156 (1995)","journal-title":"Optim. Methods Softw."},{"key":"979_CR14","doi-asserted-by":"crossref","unstructured":"Ferris, M.C., Dirkse, S.P., Meeraus, A.: Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization. In Frontiers in Applied General Equilibrium Modeling. pp. 67\u201393. Cambridge University Press, Cambridge (2005)","DOI":"10.1017\/CBO9780511614330.005"},{"key":"979_CR15","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":"979_CR16","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1080\/10556780410001654241","volume":"19","author":"R Fletcher","year":"2004","unstructured":"Fletcher, R., Leyffer, S.: Solving mathematical programs with complementarity constraints as nonlinear programs. Optim. Methods Softw. 19, 15\u201340 (2004)","journal-title":"Optim. Methods Softw."},{"key":"979_CR17","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S., Toint, P.: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13, 44\u201359 (2002)","journal-title":"SIAM J. Optim."},{"key":"979_CR18","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1137\/04060754x","volume":"16","author":"ADM Friedlander","year":"2005","unstructured":"Friedlander, A.D.M., Nogales, F., Scholtes, S.: A two-sided relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 16, 587\u2013609 (2005)","journal-title":"SIAM J. Optim."},{"key":"979_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10107-010-0426-y","volume":"133","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S.: An LPCC approach to nonconvex quadratic programs. Math. Program. 133, 243\u2013277 (2012)","journal-title":"Math. Program."},{"key":"979_CR20","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, 445\u2013471 (2008)","journal-title":"SIAM J. Optim."},{"key":"979_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10898-010-9644-3","volume":"53","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.S., Yu, B.: On linear programs with linear complementarity constraints. J. Global Optim. 53, 29\u201351 (2012)","journal-title":"J. Global Optim."},{"key":"979_CR22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/opre.21.1.353","volume":"21","author":"T Ibaraki","year":"1973","unstructured":"Ibaraki, T.: The use of cuts in complementary programming. Oper. Res. 21, 353\u2013359 (1973)","journal-title":"Oper. Res."},{"key":"979_CR23","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/0316005","volume":"16","author":"RG Jeroslow","year":"1978","unstructured":"Jeroslow, R.G.: Cutting-planes for complementarity constraints. SIAM J. Control Optim. 16, 56\u201362 (1978)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"979_CR24","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10107-018-1306-0","volume":"178","author":"J Kim","year":"2019","unstructured":"Kim, J., Tawarmalani, M., Richard, J.P.P.: On cutting planes for cardinality-constrained linear programs. Math. Program. 178(1), 417\u2013448 (2019)","journal-title":"Math. Program."},{"key":"979_CR25","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1020300717650","volume":"24","author":"M Kojima","year":"2002","unstructured":"Kojima, M., Tun\u00e7el, L.: Some fundamental properties of successive convex relaxation methods on LCP and related problems. J. Global Optim. 24, 333\u2013348 (2002)","journal-title":"J. Global Optim."},{"key":"979_CR26","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/moor.28.3.470.16391","volume":"28","author":"M Laurent","year":"2003","unstructured":"Laurent, M.: A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0\u20131 programming. Math. Oper. Res. 28, 470\u2013496 (2003)","journal-title":"Math. Oper. Res."},{"key":"979_CR27","unstructured":"Leyffer, S., Munson, T.: A globally convergent filter method for MPECs, technical report, Argonne National Laboratory (2009)"},{"key":"979_CR28","unstructured":"Leyffer, S.: MacMPEC. https:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/MacMPEC, accessed: 2016-06-02"},{"key":"979_CR29","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10589-005-3075-y","volume":"34","author":"X Liu","year":"2005","unstructured":"Liu, X., Perakis, G., Sun, J.: A robust SQP method for mathematical programs with linear complementarity constraints. Comput. Optim. Appl. 34, 5\u201333 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"979_CR30","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, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"979_CR31","doi-asserted-by":"crossref","unstructured":"Nguyen, T.T., Tawarmalani, M., Richard, J.P.P.: Convexification techniques for linear complementarity constraints. In Proceedings of the 15th international conference on Integer programming and combinatoral optimization. pp. 336\u2013348. IPCO\u201911, Springer-Verlag, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20807-2_27"},{"key":"979_CR32","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1137\/S1052623403429081","volume":"15","author":"A Raghunathan","year":"2005","unstructured":"Raghunathan, A., Biegler, L.T.: An interior point method for mathematical programs with complementarity constraints (MPCCs). SIAM J. Optim. 15, 720\u2013750 (2005)","journal-title":"SIAM J. Optim."},{"key":"979_CR33","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1002\/nav.3800310408","volume":"31","author":"B Ramarao","year":"1984","unstructured":"Ramarao, B., Shetty, C.M.: Application of disjunctive programming to the linear complementarity problem. Naval Res. Logist. Quart. 31, 589\u2013600 (1984)","journal-title":"Naval Res. Logist. Quart."},{"key":"979_CR34","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, New Jersy (1970)"},{"key":"979_CR35","unstructured":"Rutherford, T.F.: MILES: a mixed inequality and nonlinear equation solver, technical report, Department of Economics, University of Colorado, Boulder (1993)"},{"key":"979_CR36","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3, 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"979_CR37","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02192252","volume":"90","author":"HD Sherali","year":"1996","unstructured":"Sherali, H.D., Krishnamurthy, R.S., Al-Khayyal, F.A.: Enhanced intersection cutting-plane approach for linear complementarity problems. J. Optim. Theory Appl. 90, 183\u2013201 (1996)","journal-title":"J. Optim. Theory Appl."},{"key":"979_CR38","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"HD Sherali","year":"1998","unstructured":"Sherali, H.D., Krishnamurthy, R.S., Al-Khayyal, F.A.: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique. J. Optim. Theory Appl. 99, 481\u2013507 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"979_CR39","volume-title":"A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Nonconvex Optimization and its Applications","author":"HD Sherali","year":"1999","unstructured":"Sherali, H.D., Adams, W.P.: A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Nonconvex Optimization and its Applications, vol. 31. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"979_CR40","unstructured":"Tawarmalani, M.: Inclusion certificates and disjunctive programming, presented in Operations Research Seminar at GSIA, Carnegie Mellon University (2006)"},{"key":"979_CR41","unstructured":"Tawarmalani, M.: Inclusion certificates and simultaneous convexification of functions (2010), working paper, http:\/\/www.optimization-online.org\/DB_HTML\/2010\/09\/2722.html"},{"key":"979_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2809-5","volume-title":"Convex analysis and global optimization, Nonconvex Optimization and its Applications","author":"H Tuy","year":"1998","unstructured":"Tuy, H.: Convex analysis and global optimization, Nonconvex Optimization and its Applications, vol. 22. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"979_CR43","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102, 531\u2013557 (2005)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00979-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00979-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00979-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T09:22:50Z","timestamp":1623144170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00979-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,27]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["979"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00979-9","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2021,1,27]]},"assertion":[{"value":"22 January 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}