ISSN:
1436-4646
Keywords:
Linear complementarity problem
;
Incidence
;
Matrix classes
;
Principal pivoting
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract The class of fully copositive (C 0 f ) matrices introduced in [G.S.R. Murthy, T. Parthasarathy, SIAM Journal on Matrix Analysis and Applications 16 (4) (1995) 1268–1286] is a subclass of fully semimonotone matrices and contains the class of positive semidefinite matrices. It is shown that fully copositive matrices within the class ofQ 0-matrices areP 0-matrices. As a corollary of this main result, we establish that a bisymmetricQ 0-matrix is positive semidefinite if, and only if, it is fully copositive. Another important result of the paper is a constructive characterization ofQ 0-matrices within the class ofC 0 f . While establishing this characterization, it will be shown that Graves's principal pivoting method of solving Linear Complementarity Problems (LCPs) with positive semidefinite matrices is also applicable toC 0 f ∩Q 0 class. As a byproduct of this characterization, we observe that aC 0 f -matrix is inQ 0 if, and only if, it is completelyQ 0. Also, from Aganagic and Cottle's [M. Aganagic, R.W. Cottle, Mathematical Programming 37 (1987) 223–231] result, it is observed that LCPs arising fromC 0 f ∩Q 0 class can be processed by Lemke's algorithm. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01580077
Permalink
