A Partial Characterization of a Class of Matrices Defined by Solutions to the Linear Complementarity Problem

1982 ◽  
Vol 7 (2) ◽  
pp. 272-294 ◽  
Author(s):  
R. D. Doverspike ◽  
C. E. Lemke
2012 ◽  
Vol 2012 ◽  
pp. 1-15
Author(s):  
Hongchun Sun ◽  
Yiju Wang

For the extended mixed linear complementarity problem (EML CP), we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper can be taken as an extension for the classical linear complementarity problems.


2013 ◽  
Vol 15 (04) ◽  
pp. 1340036 ◽  
Author(s):  
G. S. R. MURTHY ◽  
T. PARTHASARATHY ◽  
R. SRIDHAR

The class of fully semimonotone matrices is well known in the study of the linear complementarity problem. Stone [(1981) Ph.D. thesis, Dept. of Operations Research, Stanford University, Stanford, CA] introduced this class and conjectured that the principal minors of any fully semimonotone Q0-matrix are non-negative. While the problem is still open, Murthy and Parthasarathy [(1998) Math. Program.82, 401–411] introduced the concept of incidence using which they proved that the principal minors of any matrix in the class of fully copositive Q0-matrices, a subclass of fully semimonotone Q0-matrices, are non-negative. In this paper, we study some properties of fully semimonotone matrices in connection with incidence. The main result of the paper shows that Stone's conjecture is true in the special case where the complementary cones have no partial incidence. We also present an interesting characterization of Q0 for matrices with a special structure. This result is very useful in checking whether a given matrix belongs to Q0 provided it has the special structure. Several examples are discussed in connection with incidence and Q0 property.


2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Yamna Achik ◽  
Asmaa Idmbarek ◽  
Hajar Nafia ◽  
Imane Agmour ◽  
Youssef El foutayeni

The linear complementarity problem is receiving a lot of attention and has been studied extensively. Recently, El foutayeni et al. have contributed many works that aim to solve this mysterious problem. However, many results exist and give good approximations of the linear complementarity problem solutions. The major drawback of many existing methods resides in the fact that, for large systems, they require a large number of operations during each iteration; also, they consume large amounts of memory and computation time. This is the reason which drives us to create an algorithm with a finite number of steps to solve this kind of problem with a reduced number of iterations compared to existing methods. In addition, we consider a new class of matrices called the E-matrix.


Sign in / Sign up

Export Citation Format

Share Document