Research
Communication | Open Access
Volume 2021 | Communication ID 72
Volume 2021 | Communication ID 72
A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps |
Yamna Achik, Asmaa Idmbarek, Hajar Nafia, Imane Agmour, Youssef El foutayeni
Received |
Accepted |
Published |
May 13, 2021 |
May 20, 2021 |
July 15, 2021 |
Abstract: The linear complementarity problem is receiving a lot of attention and has been studied extensively. Recently, El foutayeni et al. have contributed many works that aim to solve this mysterious problem. However, many results exist and give good approximations of the linear complementarity problem solutions. The major drawback of many existing methods resides in the fact that, for large systems, they require a large number of operations during each iteration; also, they consume large amounts of memory and computation time. This is the reason which drives us to create an algorithm with a finite ...