A new necessary and sufficient condition for the row W-property is given. By using this new condition and a special row rearrangement, we provide two global error bounds for the extended vertical linear complementarity problem under the row W-property, which extend the error bounds given in [2, 10] for the P-matrix linear complementarity problem, respectively. We show that one of the new error ...

For the extended linear complementarity problem 11], we introduce and characterize column-suuciency, row-suuciency, and P-properties. These properties are then specialized to the vertical , horizontal, and mixed linear complementarity problems.

A power penalty approach has been proposed to linear complementarity problem but not to Horizontal Linear Complementarity Problem (HLCP) because the coefficient matrix is not positive definite. It is skillfully proved that HLCP is equivalent to a variational inequality problem and a mixed linear complementarity problem for the first time. A power penalty approach is proposed to the mixed linear...

Abstract: Our purpose of this paper is to solve a class of stochastic linear complementarity problems (SLCP) with finitely many elements. Based on a new stochastic linear complementarity problem function, a new semi-smooth least squares reformulation of the stochastic linear complementarity problem is introduced. For solving the semi-smooth least squares reformulation, we propose a feasible non...

An extension of the linear complementarity problem (LCP) of mathematical programming is the so-called rational complementarity problem (RCP). This problem occurs if complementarity conditions are imposed on input and output variables of linear dynamical input/state/output systems. The resulting dynamical systems are called linear complementarity systems. Since the RCP is crucial both in issues ...