An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

International Journal of Informatics and Applied Mathematics
Volume:4 Issue:2
An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems

An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems

Authors : Welid GRİMES, Mohamed ACHACHE

Pages : 53-59

Doi:10.53508/ijiam.1036022

View : 15 | Download : 10

Publication Date : 2021-12-31

Article Type : Review Paper

Abstract :In this study, we implement a variant of infeasible interior-point algorithm for solving monotone linear complementarity problems insert ignore into journalissuearticles values(LCP);. We first reformulate the monotone LCP as an minimization problem. Then a descent iterative method is applied to the latter. The descent direction is computed via the Newton method. However, for maintaining the positivity of iterates, a novel and efficient strategy is proposed. Some numerical results are reported to show the efficiency of our proposed approach.
Keywords : Monotone linear complementarity problems, Newton method, logarithmic penalty approach

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.