Add to ORKGAbstract—In this paper, we propose a new linear complementarity problem named as bi-linear complementarity problem (BLCP) and the method for solving BLCP. In addition, the algorithm for error estimation of BLCP is also given. Numerical experiments show that the algorithm is efficient. Keywords—Bi-linear complementarity problem, Linear comple-mentarity problem, Extended linear complementarity problem, Error estimation, P-matrix, M-matrix. I
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
AbstractThe class of BS-matrices is a subclass of the P-matrices containing B-matrices. Error bounds...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
In this paper, we propose a new linear complementarity problem named as bi-linear complementarity pr...
Abstract—In this paper, we consider the generalized linear complementarity problem (GLCP). Firstly, ...
A new error bound for the linear complementarity problem is given when the involved matrix is a $B$-...
Abstract — The linear complementarity problem (LCP) is a general problem that unifies linear and qua...
Abstract An alternative error bound for linear complementarity problems for BS $B^{S}$-matrices is p...
This study centers on the task of efficiently finding a solution of the linear complementarity probl...
AbstractDoubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (...
AbstractWe introduce a fundamental quantity associated with a P-matrix and show how this quantity is...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
The linear complementarity problem is receiving a lot of attention and has been studied extensively....
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
AbstractThe class of BS-matrices is a subclass of the P-matrices containing B-matrices. Error bounds...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
In this paper, we propose a new linear complementarity problem named as bi-linear complementarity pr...
Abstract—In this paper, we consider the generalized linear complementarity problem (GLCP). Firstly, ...
A new error bound for the linear complementarity problem is given when the involved matrix is a $B$-...
Abstract — The linear complementarity problem (LCP) is a general problem that unifies linear and qua...
Abstract An alternative error bound for linear complementarity problems for BS $B^{S}$-matrices is p...
This study centers on the task of efficiently finding a solution of the linear complementarity probl...
AbstractDoubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (...
AbstractWe introduce a fundamental quantity associated with a P-matrix and show how this quantity is...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
The linear complementarity problem is receiving a lot of attention and has been studied extensively....
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...
AbstractThe class of BS-matrices is a subclass of the P-matrices containing B-matrices. Error bounds...
We generalize new criss-cross type algorithms for linear complementarity problems (LCPs) given with ...