Article ID: | iaor201111696 |
Volume: | 50 |
Issue: | 3 |
Start Page Number: | 507 |
End Page Number: | 524 |
Publication Date: | Dec 2011 |
Journal: | Computational Optimization and Applications |
Authors: | Pham Dinh Tao, Le Thi An |
Keywords: | programming: linear, programming: convex, heuristics, programming: quadratic, programming: mathematical, numerical analysis, graphs |
In this paper, we consider four optimization models for solving the Linear Complementarity (LCP) Problems. They are all formulated as DC (Difference of Convex functions) programs for which the unified DC programming and DCA (DC Algorithms) are applied. The resulting DCA are simple: they consist of solving either successive linear programs, or successive convex quadratic programs, or simply the projection of points on