AbstractTwo characterizations are given for the class of sufficient matrices defined by Cottle, Pang, and Venkateswaran. The first is a direct translation of the definition into linear-programming terms. The second can be thought of as a generalization of a theorem of T.D. Parsons on P-matrices
AbstractIn 1966, Fiedler and Pták wrote the first systematic investigation of the matrix class P0 co...
AbstractSpecially structured linear complementarity problems (LCPs) and their solution by the criss-...
AbstractP-matrices play an important role in the well-posedness of a linear complementarity problem ...
AbstractTwo characterizations are given for the class of sufficient matrices defined by Cottle, Pang...
AbstractThe classes of sufficient matrices and of P∗-matrices have recently arisen in connection wit...
AbstractThe classes of sufficient matrices and of P∗-matrices have recently arisen in connection wit...
AbstractColumn sufficient, row sufficient, and sufficient matrices have recently arisen in connectio...
AbstractIn dealing with a linear complementarity problem, much depends on knowing that the matrix, t...
In this paper we study sufficient matrices, which play an important role in theoretical analysis of ...
In this paper we study sufficient matrices, which play an important role in theoretical analysis of ...
AbstractWe give some constructive characterizations for sufficient matrices and present some matrix ...
AbstractWe give some constructive characterizations for sufficient matrices and present some matrix ...
AbstractWe pose and answer two questions about solutions of the linear complementarity problem (LCP)...
AbstractAny linear complementarity problem with a sufficient matrix can be solved by means of the un...
AbstractWe introduce a new matrix class Pc, which consists of those matrices M for which the solutio...
AbstractIn 1966, Fiedler and Pták wrote the first systematic investigation of the matrix class P0 co...
AbstractSpecially structured linear complementarity problems (LCPs) and their solution by the criss-...
AbstractP-matrices play an important role in the well-posedness of a linear complementarity problem ...
AbstractTwo characterizations are given for the class of sufficient matrices defined by Cottle, Pang...
AbstractThe classes of sufficient matrices and of P∗-matrices have recently arisen in connection wit...
AbstractThe classes of sufficient matrices and of P∗-matrices have recently arisen in connection wit...
AbstractColumn sufficient, row sufficient, and sufficient matrices have recently arisen in connectio...
AbstractIn dealing with a linear complementarity problem, much depends on knowing that the matrix, t...
In this paper we study sufficient matrices, which play an important role in theoretical analysis of ...
In this paper we study sufficient matrices, which play an important role in theoretical analysis of ...
AbstractWe give some constructive characterizations for sufficient matrices and present some matrix ...
AbstractWe give some constructive characterizations for sufficient matrices and present some matrix ...
AbstractWe pose and answer two questions about solutions of the linear complementarity problem (LCP)...
AbstractAny linear complementarity problem with a sufficient matrix can be solved by means of the un...
AbstractWe introduce a new matrix class Pc, which consists of those matrices M for which the solutio...
AbstractIn 1966, Fiedler and Pták wrote the first systematic investigation of the matrix class P0 co...
AbstractSpecially structured linear complementarity problems (LCPs) and their solution by the criss-...
AbstractP-matrices play an important role in the well-posedness of a linear complementarity problem ...
DOI
Add to ORKG