A new Approach for the Modulus-Based Matrix Splitting Algorithms

We investigate the modulus-based matrix splitting iteration algorithms for solving the linear complementarity problems (LCPs) and propose a new model to solve it. The structure of the new model is straightforward and can be extended to other issues of type of complementarity. Convergence analysis of the new approach for the symmetric positive definite matrix is also discussed. The numerical results of the proposed approach are compared with the existing algorithms to show its efficiency.