{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T23:56:58Z","timestamp":1772668618787,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1402052"],"award-info":[{"award-number":["CMMI-1402052"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334639"],"award-info":[{"award-number":["CMMI-1334639"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1334639"],"award-info":[{"award-number":["CMMI-1334639"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-15-1-0126"],"award-info":[{"award-number":["FA9550-15-1-0126"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s10107-017-1208-6","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T14:42:16Z","timestamp":1510670536000},"page":"221-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A study of the difference-of-convex approach for solving linear programs with complementarity constraints"],"prefix":"10.1007","volume":"169","author":[{"given":"Francisco","family":"Jara-Moroni","sequence":"first","affiliation":[]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3278-5637","authenticated-orcid":false,"given":"Andreas","family":"W\u00e4chter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,14]]},"reference":[{"issue":"3","key":"1208_CR1","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\u2013544 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"1208_CR2","unstructured":"Burdakov, O., Kanzow, Ch., Schwartz, A.: Mathematical programs with cardinality constraints: reformulation by complementarity-type constraints and a regularization method. Preprint 324, Institute of Mathematics, University of W\u00fcrzburg, Germany (2014) (last revised February 2015)"},{"key":"1208_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/0-387-30065-1_4","volume-title":"Large-Scale Nonlinear Optimization","author":"RH Byrd","year":"2006","unstructured":"Byrd, R.H., Nocedal, J., Waltz, R.A.: KNITRO: an integrated package for nonlinear optimization. In: di Pillo, G., Roma, M. (eds.) Large-Scale Nonlinear Optimization, pp. 35\u201359. Springer, Berlin (2006)"},{"key":"1208_CR4","doi-asserted-by":"crossref","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. SIAM classics in applied mathematics 60, Philadelphia (2009) [Originally published by Academic Press, Boston (1992)]","DOI":"10.1137\/1.9780898719000"},{"issue":"1","key":"1208_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1080\/10556788.2010.512956","volume":"27","author":"HR Fang","year":"2012","unstructured":"Fang, H.R., Leyffer, S., Munson, T.S.: A pivoting algorithm for linear programs with complementarity constraints. Optim. Methods Softw. 27(1), 89\u2013114 (2012)","journal-title":"Optim. Methods Softw."},{"key":"1208_CR6","unstructured":"Feng, M., Mitchell, J.E., Pang, J.S., W\u00e4chter, A., Shen, X.: Complementarity formulations of $$\\ell _0$$-norm optimization problems. Pac. J. Optim. (accepted August 2016)"},{"issue":"1","key":"1208_CR7","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 program with complementarity constraints as nonlinear programs. Optim. Methods Softw. 19(1), 15\u201340 (2004)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1208_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91(2), 239\u2013270 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"1208_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1137\/S1052623402407382","volume":"17","author":"R Fletcher","year":"2006","unstructured":"Fletcher, R., Leyffer, S., Ralph, D., Scholtes, S.: Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. 17(1), 259\u2013286 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1208_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Toint, Ph.L: On the global convergence of a filter-SQP algorithm. SIAM J. Optim. 13(1), 44\u201359 (2002)","journal-title":"SIAM J. Optim."},{"key":"1208_CR11","volume-title":"AMPL: A Modeling Language for Mathematical Programming","author":"R Fourer","year":"2003","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Boyd & Fraser, San Francisco (2003)"},{"issue":"1","key":"1208_CR12","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(1), 243\u2013277 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"1208_CR13","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., Yu, B.: 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":"1208_CR14","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(1), 29\u201351 (2012)","journal-title":"J. Global Optim."},{"issue":"6","key":"1208_CR15","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1287\/opre.19.6.1523","volume":"19","author":"T Ibaraki","year":"1971","unstructured":"Ibaraki, T.: Complementary programming. Oper. Res. 19(6), 1523\u20131529 (1971)","journal-title":"Oper. Res."},{"issue":"1","key":"1208_CR16","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(1), 353\u2013359 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"1208_CR17","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(1), 56\u201362 (1978)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1208_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s11750-011-0228-2","volume":"20","author":"JJ Judice","year":"2012","unstructured":"Judice, J.J.: Algorithms for linear programming with linear complementarity constraints. TOP 20(1), 4\u201325 (2012)","journal-title":"TOP"},{"key":"1208_CR19","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-319-06569-4_2","volume-title":"DC Programming and DCA for General DC Programs","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Huynh, V.N., Pham Dinh, T.: DC Programming and DCA for General DC Programs. Advances in Intelligent Systems and Computing, pp. 15\u201335. Springer, Berlin (2014)"},{"key":"1208_CR20","first-page":"1","volume":"8342","author":"HA Le Thi","year":"2014","unstructured":"Le Thi, H.A., Pham Dinh, T.: Recent advances in DC programming and DCA. Trans. Comput. Collect. Intell. 8342, 1\u201337 (2014)","journal-title":"Trans. Comput. Collect. Intell."},{"key":"1208_CR21","doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Pham Dinh, T.: The state of the art in DC programming and DCA. Research Report, Lorraine University (2013)","DOI":"10.1007\/978-3-642-54455-2_1"},{"issue":"3","key":"1208_CR22","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10589-011-9398-y","volume":"50","author":"HA Le Thi","year":"2011","unstructured":"Le Thi, H.A., Pham Dinh, T.: On solving linear complemetarity problems by DC programming and DCA. Comput. Optim. Appl. 50(3), 507\u2013524 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"1208_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"1208_CR24","unstructured":"Leyffer, S., Munson, T.S.: A globally convergent Filter method for MPECs. Preprint ANL\/MCSP1457-0907, Argonne National Laboratory, Mathematics and Computer Science Division (revised April 2009)"},{"issue":"1","key":"1208_CR25","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/040621065","volume":"17","author":"S Leyffer","year":"2006","unstructured":"Leyffer, S., Lopez-Calva, G., Nocedal, J.: Interior point methods for mathematical programs with complementarity constraints. SIAM J. Optim. 17(1), 52\u201377 (2006)","journal-title":"SIAM J. Optim."},{"key":"1208_CR26","unstructured":"Leyffer, S.: MacMPEC: AMPL collection of MPECs (2000). \n                    http:\/\/www.mcs.anl.gov\/~leyffer\/\n                    \n                  MacMPEC\/"},{"key":"1208_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511983658","volume-title":"Mathematical Programs with Equilibrium Constraints","author":"ZQ Luo","year":"1996","unstructured":"Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)"},{"issue":"1","key":"1208_CR28","first-page":"199","volume":"22","author":"OL Mangasarian","year":"1997","unstructured":"Mangasarian, O.L.: Solution of general linear complementarity problems via nondifferentiable concave minimization. Acta Mathematica Vietnamica 22(1), 199\u2013205 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"issue":"2","key":"1208_CR29","first-page":"201","volume":"37","author":"LD Muu","year":"2012","unstructured":"Muu, L.D., Dinh, Q.T., Le Thi, H.A., Pham Dinh, T.: A new decomposition algorithm for globally solving mathematical programs with affine equilibrium constraints. Acta Mathematica Vietnamica 37(2), 201\u2013218 (2012)","journal-title":"Acta Mathematica Vietnamica"},{"key":"1208_CR30","doi-asserted-by":"publisher","unstructured":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. (2016). \n                    https:\/\/doi.org\/10.1287\/moor.2016.0795","DOI":"10.1287\/moor.2016.0795"},{"issue":"1","key":"1208_CR31","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithm and applications. Acta Mathematica Vietnamica 22(1), 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"key":"1208_CR32","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafeelar","year":"1970","unstructured":"Rockafeelar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"1","key":"1208_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.25.1.1.15213","volume":"25","author":"H Scheel","year":"2000","unstructured":"Scheel, H., Scholtes, S.: Mathematical program with complementarity constraints: stationarity, optimality and sensitivity. Math. Oper. Res. 25(1), 1\u201322 (2000)","journal-title":"Math. Oper. Res."},{"key":"1208_CR34","unstructured":"Yu, B.: A branch and cut approach to linear programs with linear complementarity constraints. Ph.D. thesis. Department of Decision Sciences and Engineering Systems, Rensselaer Polytechic Institute (2011)"},{"key":"1208_CR35","first-page":"1","volume-title":"Modeling and Optimization: Theory and Applications","author":"B Yu","year":"2012","unstructured":"Yu, B., Mitchell, J.E., Pang, J.S.: Obtaining tighter relaxations of mathematical programs with complementarity constraints. In: Terlaky, T., Curtis, F. (eds.) Modeling and Optimization: Theory and Applications, pp. 1\u201323. Springer Proceedings in Mathematics and Statistics, New York (2012)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-017-1208-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1208-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-017-1208-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:21:45Z","timestamp":1589646105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-017-1208-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,14]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1208"],"URL":"https:\/\/doi.org\/10.1007\/s10107-017-1208-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,14]]},"assertion":[{"value":"13 February 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}