AbstractThe linear complementarity problem: find z∈Rp satisfying w=q+Mzw⩾0,z⩾0(LCP)zTw=0 is generalized to a problem in which the matrix M is not square. A solution technique similar to C. E. Lemke's (1965) method for solving (LCP) is given. The method is discussed from a graph-theoretic viewpoint and closely parallels a proof of Sperner's lemma by D. I. A. Cohen (1967) and some work of H. Scarf (1967) on approximating fixed points of a continuous mapping of a simplex into itself
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We consider the nonlinear complementarity problem: Find x in R^n such that: x ≥ 0 , f(x) ≥ 0 (1) x^T...
In this note, the unique solution of the linear complementarity problem (LCP) is further discussed. ...
This study centers on the task of efficiently finding a solution of the linear complementarity probl...
AbstractThe linear complementarity problem LCP(M,q) is to find a vector z in IRn satisfying zT(Mz+q)...
The linear complementarity problem is that of finding an n x 1 vector z such that, Mz + q 2 0, z 2 0...
It is shown that the linear complementarity problem of finding a z in Rn such that Mz + q > 0, z > 0...
It is shown that the linear complementarity problem of finding an n-by-1 vector x such that Mx + q ...
We define the Linear Complementarity Problem (LCP) and outline its applications including those to L...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
In this paper, we present a theoretical and numerical study of linear complementary problems solvabl...
AbstractWe consider the linear complementarity problem of finding vectors w ϵ Rn, z ϵ Rn satisfying ...
AbstractLet A be a rational n × n square matrix and b be a rational n-vector for some positive integ...
AbstractRecently, G. Alefeld, X. Chen and F. Potra [Numer. Math. 83 (1999) 265–315] presented a veri...
Let A be a rational n × n square matrix and b be a rational n-vector for some positive integer n. Th...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We consider the nonlinear complementarity problem: Find x in R^n such that: x ≥ 0 , f(x) ≥ 0 (1) x^T...
In this note, the unique solution of the linear complementarity problem (LCP) is further discussed. ...
This study centers on the task of efficiently finding a solution of the linear complementarity probl...
AbstractThe linear complementarity problem LCP(M,q) is to find a vector z in IRn satisfying zT(Mz+q)...
The linear complementarity problem is that of finding an n x 1 vector z such that, Mz + q 2 0, z 2 0...
It is shown that the linear complementarity problem of finding a z in Rn such that Mz + q > 0, z > 0...
It is shown that the linear complementarity problem of finding an n-by-1 vector x such that Mx + q ...
We define the Linear Complementarity Problem (LCP) and outline its applications including those to L...
An iterative scheme is given for solving the linear complementarity problem x> 0, Mx + q> 0, x...
In this paper, we present a theoretical and numerical study of linear complementary problems solvabl...
AbstractWe consider the linear complementarity problem of finding vectors w ϵ Rn, z ϵ Rn satisfying ...
AbstractLet A be a rational n × n square matrix and b be a rational n-vector for some positive integ...
AbstractRecently, G. Alefeld, X. Chen and F. Potra [Numer. Math. 83 (1999) 265–315] presented a veri...
Let A be a rational n × n square matrix and b be a rational n-vector for some positive integer n. Th...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We consider the nonlinear complementarity problem: Find x in R^n such that: x ≥ 0 , f(x) ≥ 0 (1) x^T...
In this note, the unique solution of the linear complementarity problem (LCP) is further discussed. ...