We revisit the class of column competent matrices and study some matrix theoretic properties this class. The local w-uniqueness solutions to linear complementarity problem can be identified by matrices. establish new results on in connection with These are significant context theory as well algorithms operations research. prove locally property Finally, we a between adequate help degree theory.

For getting the numerical solution of linear complementary problem (LCP), there are many methods such as modulus-based matrix splitting iteration and nonsmooth Newton?s method. We proposed Square-Newton method to solve LCP. This could LCP efficiently. gave theoretical analysis experiments in paper.

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 ...

In this paper, we analyze the stability and convergence of a one-layer neural network proposed by Gao and Wang, which is designed to solve a class of horizontal linear complementarity problems. The globally asymptotical stability and globally exponential stability of this network are proved strictly under mild conditions, respectively. Meanwhile, this network is applied to solve a transportatio...