EUVIMEDEUVIMED entdecken
Crossref

An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems

Welid GRİMES, Mohamed ACHACHE

International Journal of Informatics and Applied Mathematics · 2021

DOI: 10.53508/ijiam.1036022 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Informatics and Applied Mathematics, 2021. Verfasst von Welid GRİMES und 1 weiteren Autor:innen. Die Arbeit nennt 3 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Zitieren

APA

GRİMES, W., & ACHACHE, M. (2021). An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems. International Journal of Informatics and Applied Mathematics. https://doi.org/10.53508/ijiam.1036022

Vancouver

GRİMES W, ACHACHE M. An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems. International Journal of Informatics and Applied Mathematics. 2021. doi:10.53508/ijiam.1036022

BibTeX
@article{GRMES2021,
  author = {GRİMES, Welid and ACHACHE, Mohamed},
  title = {An Infeasible Interior-point Algorithm for Monotone Linear Complementarity Problems},
  journal = {International Journal of Informatics and Applied Mathematics},
  year = {2021},
  doi = {10.53508/ijiam.1036022}
}
Kostenlos starten →