In this paper, we extend modulus-based matrix splitting iteration methods to horizontal linear
complementarity problems. We consider both standard and accelerated methods and …

We introduce a modulus-based formulation for vertical linear complementarity problems
(VLCPs) with an arbitrary number ℓ of matrices. This formulation can be used to set up a …

In this paper, we generalize the projected Jacobi and the projected Gauss–Seidel methods
to vertical linear complementarity problems (VLCPs) characterized by matrices with positive …

In this paper, for solving horizontal linear complementarity problems, a two-step modulus-
based matrix splitting iteration method is established. The convergence analysis of the …

In this paper we consider a general algorithmic framework for solving nonlinear mixed
complementarity problems. The main features of this framework are:(a) it is well-defined for …

In this paper, for solving large sparse vertical linear complementarity problems, the modulus-
based synchronous multisplitting iteration method is established. Convergence theorems of …

This paper considers the balanced form of the standard linear complementarity problem with
unique solution and provides a more precise expression of an upper error bound discovered …

In this paper, first we propose a general modulus-based matrix splitting iteration method for
solving horizontal linear complementarity problems. In order to improve the computing …

Complementarity problems arise in a wide variety of disciplines. Prototypical examples
include the Wardropian and Walrasian equilibrium models encountered in the engineering …

In this paper, we establish a modulus-based nonsmooth Newton's method for solving a class
of horizontal nonlinear complementarity problems and prove the nearly quadratic …