{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:49:53Z","timestamp":1767340193628},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,2,23]],"date-time":"2011-02-23T00:00:00Z","timestamp":1298419200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1007\/s10589-011-9398-y","type":"journal-article","created":{"date-parts":[[2011,2,22]],"date-time":"2011-02-22T14:48:53Z","timestamp":1298386133000},"page":"507-524","source":"Crossref","is-referenced-by-count":24,"title":["On solving Linear Complementarity Problems by DC programming and DCA"],"prefix":"10.1007","volume":"50","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Tao","family":"Pham Dinh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,2,23]]},"reference":[{"key":"9398_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02591868","volume":"26","author":"B.-H. Ahn","year":"1983","unstructured":"Ahn, B.-H.: Iterative methods for linear complementarity problems with upper bounds on primary variables. Math. Program. 26, 295\u2013315 (1983)","journal-title":"Math. Program."},{"issue":"2","key":"9398_CR2","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/S1052623498335080","volume":"11","author":"X. Chen","year":"2000","unstructured":"Chen, X., Ye, Y.: On smoothing methods for the P 0 matrix linear complementarity problem. SIAM J. Optim. 11(2), 341\u2013363 (2000)","journal-title":"SIAM J. Optim."},{"key":"9398_CR3","volume-title":"The Linear Complementarity Problem","author":"R. Cottle","year":"1992","unstructured":"Cottle, R., Pang, J., Stone, R.: The Linear Complementarity Problem. Academic Press, San Diego (1992)"},{"key":"9398_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01588254","volume":"17","author":"Y. Fathi","year":"1979","unstructured":"Fathi, Y.: Computational complexity of LCPs associated with positive definite symmetric matrices. Math. Program. 17, 335\u2013344 (1979)","journal-title":"Math. Program."},{"key":"9398_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s002450010021","volume":"43","author":"L. Fernandes","year":"2001","unstructured":"Fernandes, L., Friedlander, A., Guedes, M.C., Judice, J.: Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP. Appl. Math. Optim. 43, 1\u201319 (2001)","journal-title":"Appl. Math. Optim."},{"key":"9398_CR6","isbn-type":"print","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization. Wiley, New York (1987). ISBN13:978-0471494638","ISBN":"http:\/\/id.crossref.org\/isbn\/978047149463"},{"key":"9398_CR7","series-title":"Nonconvex Optimization and Its Applications","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"C.A. Floudas","year":"1999","unstructured":"Floudas, C.A., et al.: Handbook of Test Problems in Local and Global Optimization. Nonconvex Optimization and Its Applications, vol.\u00a033. Kluwer Academic, Dordrecht (1999). XV"},{"issue":"1","key":"9398_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02578944","volume":"10","author":"J. Judice","year":"2002","unstructured":"Judice, J., Faustino, A.M., Ribeiro, I.M.: On the solution of NP-hard linear complementarity problems. Top 10(1), 125\u2013145 (2002)","journal-title":"Top"},{"issue":"2","key":"9398_CR9","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00249054","volume":"5","author":"C. Geiger","year":"1996","unstructured":"Geiger, C., Kanzow, C.: On the resolution of monotone complementarity problems. Comput. Optim. Appl. 5(2), 155\u2013173 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"9398_CR10","isbn-type":"print","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1015330.1015344","volume-title":"Proceedings of the 21st International Conference on Machine Learning, ICML, 2004","author":"N. Krause","year":"2004","unstructured":"Krause, N., Singer, Y.: Leveraging the margin more carefully In: Proceedings of the 21st International Conference on Machine Learning, ICML, 2004, Banff, Alberta, Canada, p.\u00a063 (2004). ISBN:1-58113-828-5","ISBN":"http:\/\/id.crossref.org\/isbn\/1581138285"},{"issue":"3","key":"9398_CR11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"H.A. Le Thi","year":"1997","unstructured":"Le Thi, H.A., Pham Dinh, T.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Glob. Optim. 11(3), 253\u2013285 (1997)","journal-title":"J. Glob. Optim."},{"key":"9398_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. 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":"9398_CR13","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1198\/106186005X37238","volume":"14","author":"Y. Liu","year":"2005","unstructured":"Liu, Y., Shen, X., Doss, H.: Multicategory \u03c8-learning and support vector machine: computational tools. J. Comput. Graph. Stat. 14, 219\u2013236 (2005)","journal-title":"J. Comput. Graph. Stat."},{"key":"9398_CR14","series-title":"Sigma Series in Applied Mathematics","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K.G. Murty","year":"1988","unstructured":"Murty, K.G.: Linear Complementarity, Linear and Nonlinear Programming. Sigma Series in Applied Mathematics, vol.\u00a03. Heldermann, Berlin (1988),"},{"key":"9398_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-94-015-8330-5_3","volume-title":"Advances in Optimization and Numerical Analysis","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M.: The linear complementarity problem. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis, pp. 39\u201349. Kluwer Academic, Norwell (1994)."},{"issue":"2","key":"9398_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1137\/0909022","volume":"9","author":"P.M. Pardalos","year":"1988","unstructured":"Pardalos, P.M., Rosen, J.B.: Global optimization approach to the linear complementarity problem. SIAM J. Sci. Stat. Comput. 92, 341\u2013353 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"1","key":"9398_CR17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard. J. Glob. Optim. 1(1), 15\u201322 (1991)","journal-title":"J. Glob. Optim."},{"key":"9398_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M., Ye, Y.: A class of linear complementarity problems solvable in polynomial time. Linear Algebra Appl. 152, 3\u201317 (1991)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9398_CR19","first-page":"289","volume":"22","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to d.c. programming: theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"issue":"2","key":"9398_CR20","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T. Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: D.c. optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"9398_CR21","isbn-type":"print","first-page":"201","volume-title":"Proceedings of the 23rd International Conference on Machine Learning, ICML 2006","author":"C. Ronan","year":"2006","unstructured":"Ronan, C., Fabian, S., Jason, W., L\u00e9on, B.: Trading convexity for scalability. In: Proceedings of the 23rd International Conference on Machine Learning, ICML 2006, Pittsburgh, Pennsylvania, pp.\u00a0201\u2013208 (2006). ISBN:1-59593-383-2","ISBN":"http:\/\/id.crossref.org\/isbn\/1595933832"},{"key":"9398_CR22","volume-title":"Advances in Discrete Tomography and Its Applications","author":"C. Schn\u00f6rr","year":"2007","unstructured":"Schn\u00f6rr, C., Sch\u00fcle, T., Weber, S.: Variational reconstruction with DC-programming. In: Herman, G.T., Kuba, A. (eds.) Advances in Discrete Tomography and Its Applications. Birkh\u00e4user, Boston (2007)"},{"key":"9398_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.dam.2005.02.028","volume":"151","author":"T. Sch\u00fcle","year":"2005","unstructured":"Sch\u00fcle, T., Schn\u00f6rr, C., Weber, S., Hornegger, J.: Discrete tomography by convex-concave regularization and d.c. programming. Discrete Appl. Math. 151, 229\u2013243 (2005)","journal-title":"Discrete Appl. Math."},{"key":"9398_CR24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1023\/A:1021734613201","volume":"99","author":"H. Sherali","year":"1998","unstructured":"Sherali, H., Krishnamurty, R., Al-Khayyal, F.: 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."},{"issue":"4","key":"9398_CR25","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1137\/S1052623401384151","volume":"13","author":"Y.-B. Zhao","year":"2003","unstructured":"Zhao, Y.-B., Li, D.: A globally and locally superlinearly convergent non-interior-point algorithm for P0 LCPs. SIAM J. Optim. 13(4), 1195\u20131221 (2003)","journal-title":"SIAM J. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9398-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9398-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9398-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:40Z","timestamp":1559288200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9398-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,23]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["9398"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9398-y","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,23]]}}}