IDEAS home Printed from https://ideas.repec.org/a/wly/jnlaaa/v2020y2020i1n8881915.html
   My bibliography  Save this article

A Fast Algorithm for Solving a Class of the Linear Complementarity Problem in a Finite Number of Steps

Author

Listed:
  • Yamna Achik
  • Asmaa Idmbarek
  • Hajar Nafia
  • Imane Agmour
  • Youssef El foutayeni

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 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.

Suggested Citation

Handle: RePEc:wly:jnlaaa:v:2020:y:2020:i:1:n:8881915
DOI: 10.1155/2020/8881915
as

Download full text from publisher

File URL: https://doi.org/10.1155/2020/8881915
Download Restriction: no
File URL: https://libkey.io/10.1155/2020/8881915?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnlaaa:v:2020:y:2020:i:1:n:8881915. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1155/4058 .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.