Karamardian Matrices: A Generalization of QQ-Matrices

preprint2021arXivOpen access

Abstract

A real square matrix AA is called a QQ-matrix if the linear complementarity problem LCP(A,q)LCP(A,q) has a solution for all q∈Rnq \in \mathbb{R}^n. This means that for every vector qq there exists a vector xx such that x≥0,y=Ax+q≥0x \geq 0, y=Ax+q\geq 0 and xTy=0x^Ty=0. A well known result of Karamardian states that if the problems LCP(A,0)LCP(A,0) and LCP(A,d)LCP(A,d) for some d∈Rn,d>0d\in \mathbb{R}^n, d >0 have only the zero solution, then AA is a QQ-matrix. By relaxing the condition on dd and imposing a condition on the solution vector xx in the two problems as above, the authors introduce a new class of matrices called Karamardian matrices, requiring that these two modified problems have only zero as a solution. In this article, a systematic treatment of Karamardian matrices is undertaken. Among other things, it is shown how Karamardian matrices have properties that are analogous to those of QQ-matrices. A subclass of a recently introduced notion of P#P_{\#}-matrices is shown to possess the Karamardian property, and for this reason we undertake a thorough study of P#P_{\#}-matrices and make some fundamental contributions.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.