In this paper, we propose two splitting methods for solving horizontal linear complementarity problems characterized by matrices with positive diagonal elements. The proposed procedures are based on the Jacobi and on the Gauss–Seidel iterations and differ from existing techniques in that they act directly and simultaneously on both matrices of the problem. We prove the convergence of the methods under some assumptions on the diagonal dominance of the matrices of the problem. Several numerical experiments, including large-scale problems of practical interest, demonstrate the capabilities of the proposed methods in various situations
Abstract In this paper, we demonstrate a complete version of the convergence theory of the modulus-b...
In this paper we give algorithms for solving linear complementarity problems for -matrices and symme...
We introduce a modulus-based formulation for vertical linear complementarity problems (VLCPs) with a...
In this paper, we generalize modulus-based matrix splitting methods to a class of horizontal nonline...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
AbstractIn this paper, we study the splitting method and two-stage splitting method for the linear c...
AbstractIn this note, we present an algorithm to reduce a horizontal linear complementarity problem ...
We consider iterative methods using splittings for solving symmetric positive semidefinite linear co...
We propose a method for accelerating iterative algorithms for solving symmetric linear complementari...
AbstractWe present an inexact multisplitting method for solving the linear complementarity problems,...
In this paper, we analyze the relationship between projected and (possibly accelerated) modulus-base...
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear compl...
In the present work we consider the iterative solution of the Linear Complementarity Problem (LCP), ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
Abstract In this paper, we demonstrate a complete version of the convergence theory of the modulus-b...
In this paper we give algorithms for solving linear complementarity problems for -matrices and symme...
We introduce a modulus-based formulation for vertical linear complementarity problems (VLCPs) with a...
In this paper, we generalize modulus-based matrix splitting methods to a class of horizontal nonline...
We consider a matrix splitting algorithm for the linear complementarity problem where the matrix is ...
AbstractOver the years, many methods for solving the linear complementarity problem (LCP) have been ...
AbstractIn this paper, we study the splitting method and two-stage splitting method for the linear c...
AbstractIn this note, we present an algorithm to reduce a horizontal linear complementarity problem ...
We consider iterative methods using splittings for solving symmetric positive semidefinite linear co...
We propose a method for accelerating iterative algorithms for solving symmetric linear complementari...
AbstractWe present an inexact multisplitting method for solving the linear complementarity problems,...
In this paper, we analyze the relationship between projected and (possibly accelerated) modulus-base...
A unified treatment is given for iterative algorithms for the solution of the symmetric 1inear compl...
In the present work we consider the iterative solution of the Linear Complementarity Problem (LCP), ...
AbstractThe convergence of the multiplicative multisplitting-type method for solving the linear comp...
Abstract In this paper, we demonstrate a complete version of the convergence theory of the modulus-b...
In this paper we give algorithms for solving linear complementarity problems for -matrices and symme...
We introduce a modulus-based formulation for vertical linear complementarity problems (VLCPs) with a...