On solving Linear Complementarity Problems by DC programming and DCA

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 \(\mathbb{R}_{+}^{2n}\). 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.

[1]  Christoph Schnörr,et al.  Variational Reconstruction with DC-Programming , 2007 .

[2]  T. P. Dinh,et al.  Convex analysis approach to d.c. programming: Theory, Algorithm and Applications , 1997 .

[3]  Xiaojun Chen,et al.  On Smoothing Methods for the P[sub 0] Matrix Linear Complementarity Problem , 2000, SIAM J. Optim..

[4]  Yufeng Liu,et al.  Multicategory ψ-Learning and Support Vector Machine: Computational Tools , 2005 .

[5]  Le Thi Hoai An,et al.  The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems , 2005, Ann. Oper. Res..

[6]  Y. Ye,et al.  Algorithms for the solution of quadratic knapsack problems , 1991 .

[7]  Panos M. Pardalos,et al.  Quadratic programming with one negative eigenvalue is NP-hard , 1991, J. Glob. Optim..

[8]  Hoai An Le Thi,et al.  Solving a Class of Linearly Constrained Indefinite Quadratic Problems by D.C. Algorithms , 1997 .

[9]  Christian Kanzow,et al.  On the resolution of monotone complementarity problems , 1996, Comput. Optim. Appl..

[10]  Ahn Byong-hun.  Iterative methods for linear complementarity problems with upperbounds on primary variables , 1983 .

[11]  Duan Li,et al.  A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P[sub 0] LCPs , 2002, SIAM J. Optim..

[12]  Byong-Hun Ahn,et al.  Iterative methods for linear complementarity problems with upperbounds on primary variables , 1983, Mathematical programming.

[13]  Susana Gomez,et al.  Advances in Optimization and Numerical Analysis , 1994 .

[14]  J. Júdice,et al.  Solution of a General Linear Complementarity Problem Using Smooth Optimization and Its Application to Bilinear Programming and LCP , 2001 .

[15]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[16]  C. Floudas.  Handbook of Test Problems in Local and Global Optimization , 1999 .

[17]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[18]  Jason Weston,et al.  Trading convexity for scalability , 2006, ICML.

[19]  Marc Toussaint,et al.  Probabilistic inference for solving discrete and continuous state Markov Decision Processes , 2006, ICML.

[20]  G. Herman,et al.  Advances in discrete tomography and its applications , 2007 .

[21]  Yoram Singer,et al.  Leveraging the margin more carefully , 2004, ICML.

[22]  Le Thi Hoai An,et al.  A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem , 1998, SIAM J. Optim..

[23]  Yahya FATHI,et al.  Computational complexity of LCPs associated with positive definite symmetric matrices , 1979, Math. Program..

[24]  Panos M. Pardalos.  The Linear Complementarity Problem , 1994 .

[25]  Joaquim J. Júdice,et al.  On the solution of NP-hard linear complementarity problems , 2002 .

[26]  W. Gander,et al.  A D.C. OPTIMIZATION ALGORITHM FOR SOLVING THE TRUST-REGION SUBPROBLEM∗ , 1998 .

[27]  Christoph Schnörr,et al.  Discrete tomography by convex-concave regularization and D.C. programming , 2005, Discret. Appl. Math..

[28]  Y. Ye,et al.  A Class of Linear Complementarity Problems Solvable in Polynomial Time , 1991 .

[29]  H. Sherali,et al.  Enumeration Approach for Linear Complementarity Problems Based on a Reformulation-Linearization Technique , 1998 .

[30]  J. B. Rosen,et al.  Global optimization approach to the linear complementarity problem , 1988 .

[31]  Katta G. Murty,et al.  Linear complementarity, linear and nonlinear programming , 1988 .