Based on the concept of the regularized central path, a new non-interior-point path-following algorithm is proposed for solving the P0 linear complementarity problem (P0 LCP). The condition ensuring the global convergence of the algorithm for P0 LCPs is weaker than most previously used ones in the literature. This condition can be satisfied even when the strict feasibility condition, which has ...

In this paper, we consider an algebraic additive Schwarz iteration scheme for solving the nite-dimensional linear complementarity problem that involves an M-matrix. The scheme contains some existing algorithms as special cases. We establish monotone convergence of the iteration scheme under appropriate conditions. Moreover, using the concept of weak regular splitting, we estimate weighted max-n...

We are interested in finding a solution to the tensor complementarity problem with strong M-tensor, which we call M-tensor problem. propose lower dimensional linear equation approach solve that At each iteration, only system of needs be solved. The coefficient matrices systems independent iteration after finitely many iterations. show starting from zero or some nonnegative point, method generat...