More on positive subdefinite matrices and the linear complementarity problem (Q5955663)

The authors consider positive subdefinite matrices (PSBD) studied by \textit{J.-P. Crouzeix}, \textit{A. Hassouni}, \textit{A. Lahlou}, and \textit{S. Schaible} [SIAM J. Matrix Anal. Appl. 22, No. 1, 66--85 (2000; Zbl 0985.26008)] and show that linear complementarity problems with PSBD matrices of rank \(\geq 2\) are processable by Lemke's algorithm and that a PSBD matrix of rank \(\geq 2\) belongs to the class of sufficient matrices introduced by \textit{R. W. Cottle}, \textit{J.-S. Pang} and \textit{V. Venkateswaran} [Linear Algebra Appl. 114/115, 231--249 (1989; Zbl 0674.90092)]. They also show that if a matrix \(A\) is a sum of a merely positive subdefinite copositive plus matrix and a copositive matrix, and a feasibility condition is satisfied, then Lemke's algorithm solves \(LPC(q,A)\).NEWLINENEWLINENEWLINEIn Section 2, the authors present the required definitions, introduce the notations and state the relevant results used in this paper. In Section 3, they prove their main results.