In this study, we implement a variant of infeasible interior-point algorithm for solving monotone linear complementarity problems (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.
| Primary Language | English |
|---|---|
| Subjects | Applied Mathematics |
| Journal Section | Review Article |
| Authors | |
| Acceptance Date | January 2, 2022 |
| Publication Date | December 31, 2021 |
| Published in Issue | Year 2021 Volume: 4 Issue: 2 |
International Journal of Informatics and Applied Mathematics