A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps
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 sol...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Abstract and Applied Analysis |
| Online Access: | http://dx.doi.org/10.1155/2020/8881915 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832566342110150656 |
|---|---|
| author | Yamna Achik Asmaa Idmbarek Hajar Nafia Imane Agmour Youssef El foutayeni |
| author_facet | Yamna Achik Asmaa Idmbarek Hajar Nafia Imane Agmour Youssef El foutayeni |
| author_sort | Yamna Achik |
| collection | DOAJ |
| description | 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 number of steps to solve this kind of problem with a reduced number of iterations compared to existing methods. In addition, we consider a new class of matrices called the E-matrix. |
| format | Article |
| id | doaj-art-68b91cc3fd50430a8146beff90d859e7 |
| institution | Kabale University |
| issn | 1085-3375 1687-0409 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Abstract and Applied Analysis |
| spelling | doaj-art-68b91cc3fd50430a8146beff90d859e72025-02-03T01:04:29ZengWileyAbstract and Applied Analysis1085-33751687-04092020-01-01202010.1155/2020/88819158881915A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of StepsYamna Achik0Asmaa Idmbarek1Hajar Nafia2Imane Agmour3Youssef El foutayeni4Analysis, Modeling and Simulation Laboratory, Hassan II University, MoroccoAnalysis, Modeling and Simulation Laboratory, Hassan II University, MoroccoAnalysis, Modeling and Simulation Laboratory, Hassan II University, MoroccoAnalysis, Modeling and Simulation Laboratory, Hassan II University, MoroccoAnalysis, Modeling and Simulation Laboratory, Hassan II University, MoroccoThe 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 number of steps to solve this kind of problem with a reduced number of iterations compared to existing methods. In addition, we consider a new class of matrices called the E-matrix.http://dx.doi.org/10.1155/2020/8881915 |
| spellingShingle | Yamna Achik Asmaa Idmbarek Hajar Nafia Imane Agmour Youssef El foutayeni A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps Abstract and Applied Analysis |
| title | A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps |
| title_full | A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps |
| title_fullStr | A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps |
| title_full_unstemmed | A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps |
| title_short | A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps |
| title_sort | fast algorithm for solving a class of the linear complementarity problem in a finite number of steps |
| url | http://dx.doi.org/10.1155/2020/8881915 |
| work_keys_str_mv | AT yamnaachik afastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT asmaaidmbarek afastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT hajarnafia afastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT imaneagmour afastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT youssefelfoutayeni afastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT yamnaachik fastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT asmaaidmbarek fastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT hajarnafia fastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT imaneagmour fastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps AT youssefelfoutayeni fastalgorithmforsolvingaclassofthelinearcomplementarityprobleminafinitenumberofsteps |