Karamardian Matrices: A Generalization of $Q$-Matrices
K.C. Sivakumar, P. Sushmitha, Megan Wendler

TL;DR
This paper introduces Karamardian matrices, a new class generalizing $Q$-matrices, and explores their properties, including their relation to $P_{ ext{ extunderscore}} ext{ extunderscore}$-matrices, with implications for linear complementarity problems.
Contribution
The authors define Karamardian matrices, analyze their properties, and establish their connection to $Q$-matrices and $P_{ ext{ extunderscore}} ext{ extunderscore}$-matrices, expanding the theoretical framework of complementarity problems.
Findings
Karamardian matrices share properties with $Q$-matrices.
A subclass of $P_{ ext{ extunderscore}} ext{ extunderscore}$-matrices is shown to be Karamardian.
The paper provides a systematic study of Karamardian matrices and their properties.
Abstract
A real square matrix is called a -matrix if the linear complementarity problem has a solution for all . This means that for every vector there exists a vector such that and . A well known result of Karamardian states that if the problems and for some have only the zero solution, then is a -matrix. By relaxing the condition on and imposing a condition on the solution vector 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 -matrices. A…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Topics in Algebra
