Two classes of modulus-based methods for solving linear complementarity problems

This study focuses on developing efficient numerical methods to solve linear complementarity problems (LCP). There are many problems in various fields like engineering, economics, and science that lead to an LCP. Modulus-based methods are powerful computational tools for solving such problems. In this paper, the schemes for solving LCPs are based on modulus. The new methods utilize two initial guesses and update each of the initial guesses in separate steps. Convergence of new methods is expressed under special conditions when the system matrix is an H+-matrix. Also, the presented numerical results confirm the efficiency of the new techniques compared to the modulus-based and two-step modulus-based methods.