A new subclass of Q0-matrix in linear complementarity theory

In this article, we introduce a new matrix class L¯(d) (a subclass of Q0-matrices which are obtained as a limit of a sequence of L(d)-matrices) such that for any A in this class, a solution to LCP(q,A) exists if LCP(q,A) is feasible, and Lemke's algorithm will find a solution or demonstrate inf...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Linear algebra and its applications 2022-08, Vol.647, p.64-77
Hauptverfasser:	Singh, Gambheer, Neogy, S.K., Kumar, Promila
Format:	Artikel
Sprache:	eng
Schlagworte:	[formula omitted]-matrix Algorithms Games Lemke's algorithm Linear algebra Linear complementarity problem Mathematical analysis Matrices (mathematics) Polymatrix games
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!