Combined approach to solve linear complementarity problem
In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence of these algorithms. Numerical simulation...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Publishing House of the Romanian Academy
2016-12-01
|
| Series: | Journal of Numerical Analysis and Approximation Theory |
| Subjects: | |
| Online Access: | https://www.ictp.acad.ro/jnaat/journal/article/view/1088 |
| _version_ | 1818198369443512320 |
|---|---|
| author | Kebbiche Zakia Roumili Hayet |
| author_facet | Kebbiche Zakia Roumili Hayet |
| author_sort | Kebbiche Zakia |
| collection | DOAJ |
| description |
In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence of these algorithms.
Numerical simulations and comparative results of the new approach are provided.
Since the quadratic convex program and linear program can be written as (LCP), so it can be resolved thanks to our new approach.
|
| first_indexed | 2024-12-12T02:04:47Z |
| format | Article |
| id | doaj.art-22c576bdf2844bfb86c5e5bc0d38a999 |
| institution | Directory Open Access Journal |
| issn | 2457-6794 2501-059X |
| language | English |
| last_indexed | 2024-12-12T02:04:47Z |
| publishDate | 2016-12-01 |
| publisher | Publishing House of the Romanian Academy |
| record_format | Article |
| series | Journal of Numerical Analysis and Approximation Theory |
| spelling | doaj.art-22c576bdf2844bfb86c5e5bc0d38a9992022-12-22T00:42:04ZengPublishing House of the Romanian AcademyJournal of Numerical Analysis and Approximation Theory2457-67942501-059X2016-12-01452Combined approach to solve linear complementarity problemKebbiche Zakia0Roumili Hayet1Department of mathematics, Faculty of Sciences, University of Ferhat Abbas, Sétif1, Algeria.Department of mathematics, Faculty of Sciences, University of Ferhat Abbas, Sétif1, Algeria. In this paper, we present a new approach in order to solve the linear complementary problem noted (LCP). We have combined the ideas of Lemke's method and its variants taking advantage of the benefits of each approach in order to improve the convergence of these algorithms. Numerical simulations and comparative results of the new approach are provided. Since the quadratic convex program and linear program can be written as (LCP), so it can be resolved thanks to our new approach. https://www.ictp.acad.ro/jnaat/journal/article/view/1088linear complementarity problemLemke algorithmquadratic convex programlinear programpivot |
| spellingShingle | Kebbiche Zakia Roumili Hayet Combined approach to solve linear complementarity problem Journal of Numerical Analysis and Approximation Theory linear complementarity problem Lemke algorithm quadratic convex program linear program pivot |
| title | Combined approach to solve linear complementarity problem |
| title_full | Combined approach to solve linear complementarity problem |
| title_fullStr | Combined approach to solve linear complementarity problem |
| title_full_unstemmed | Combined approach to solve linear complementarity problem |
| title_short | Combined approach to solve linear complementarity problem |
| title_sort | combined approach to solve linear complementarity problem |
| topic | linear complementarity problem Lemke algorithm quadratic convex program linear program pivot |
| url | https://www.ictp.acad.ro/jnaat/journal/article/view/1088 |
| work_keys_str_mv | AT kebbichezakia combinedapproachtosolvelinearcomplementarityproblem AT roumilihayet combinedapproachtosolvelinearcomplementarityproblem |