AbstractWe introduce a new matrix class Pc, which consists of those matrices M for which the solution set of the corresponding linear complementarity problem is connected for every q ϵ Rn. We consider Lemke's pivotal method from the perspective of piecewise linear homotopies and normal maps and show that Lemke's method processes all matrices in Pc ∩ Q0. We further investigate the relationship of the class Pc to other known matrix classes and show that column sufficient matrices are a subclass of Pc, as are 2 × 2 P0-matrices
AbstractColumn sufficient, row sufficient, and sufficient matrices have recently arisen in connectio...
Although LCP(q,M), where M is a general integer matrix, is NP-complete, LCPs corresponding to intege...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We introduce a new matrix class Pc , which consists of those matrices M for which the solution set o...
AbstractWe introduce a new matrix class Pc, which consists of those matrices M for which the solutio...
AbstractA new subclass of P-matrices is stated for which it is easy to calculate bounds for the solu...
The class of positive definite and positive semidefinite matrices is one of the most frequently enco...
This study centers on the task of efficiently finding a solution of the linear complementarity probl...
AbstractThe paper is a collection of results on the linear complementarity problem (q, M). The resul...
AbstractIn this article, we consider positive subdefinite matrices (PSBD) recently studied by J.-P. ...
AbstractSpecially structured linear complementarity problems (LCPs) and their solution by the criss-...
The semidefinite linear complementarity problem (SDLCP) is ageneralization of the linear complementa...
We characterize the class of integral square matrices M having the property that for every integral ...
The linear complementarity problem is that of finding an n x 1 vector z such that, Mz + q 2 0, z 2 0...
The goal of this thesis is to give a better understanding of the linear complementarity problem with...
AbstractColumn sufficient, row sufficient, and sufficient matrices have recently arisen in connectio...
Although LCP(q,M), where M is a general integer matrix, is NP-complete, LCPs corresponding to intege...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We introduce a new matrix class Pc , which consists of those matrices M for which the solution set o...
AbstractWe introduce a new matrix class Pc, which consists of those matrices M for which the solutio...
AbstractA new subclass of P-matrices is stated for which it is easy to calculate bounds for the solu...
The class of positive definite and positive semidefinite matrices is one of the most frequently enco...
This study centers on the task of efficiently finding a solution of the linear complementarity probl...
AbstractThe paper is a collection of results on the linear complementarity problem (q, M). The resul...
AbstractIn this article, we consider positive subdefinite matrices (PSBD) recently studied by J.-P. ...
AbstractSpecially structured linear complementarity problems (LCPs) and their solution by the criss-...
The semidefinite linear complementarity problem (SDLCP) is ageneralization of the linear complementa...
We characterize the class of integral square matrices M having the property that for every integral ...
The linear complementarity problem is that of finding an n x 1 vector z such that, Mz + q 2 0, z 2 0...
The goal of this thesis is to give a better understanding of the linear complementarity problem with...
AbstractColumn sufficient, row sufficient, and sufficient matrices have recently arisen in connectio...
Although LCP(q,M), where M is a general integer matrix, is NP-complete, LCPs corresponding to intege...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...