On solving Linear Complementarity Problems by DC programming and DCA

On solving Linear Complementarity Problems by DC programming and DCA

0.00 Avg rating0 Votes
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: ,
Keywords: programming: linear, programming: convex, heuristics, programming: quadratic, programming: mathematical, numerical analysis, graphs
Abstract:

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 + 2 n equ1 . Numerical experiments on several test problems illustrate the efficiency of the proposed approaches in terms of the quality of the obtained solutions, the speed of convergence, and so on. Moreover, the comparative results with Lemke algorithm, a well known method for the LCP, show that DCA outperforms the Lemke method.

Reviews

Required fields are marked *. Your email address will not be published.