On Semimonotone Star Matrices and Linear Complementarity Problem
R. Jana, A. K. Das, S. Sinha

TL;DR
This paper introduces the class of semimonotone star ($E_0^s$) matrices, explores their properties in complementarity problems, and proposes an interior point algorithm for solving LCPs with these matrices.
Contribution
It defines the $E_0^s$ and $ ilde{E_0^s}$ matrix classes, analyzes their properties, and develops an interior point method for LCPs involving these matrices.
Findings
$ ilde{E_0^s}$-matrices are in $P_0$ and in $E_0^f$
LCP$(q, A)$ is processable by Lemke's algorithm if $A otin ilde{E_0^s}$ but in $P_0$
Proposed an interior point algorithm for solving LCP$(q, A)$ with $A otin ilde{E_0^s}$
Abstract
In this article, we introduce the class of semimonotone star () matrices. We establish the importance of the class of -matrices in the context of complementarity theory. We show that the principal pivot transform of -matrix is not necessarily in general. However, we prove that -matrices, a subclass of the -matrices with some additional conditions, is in by showing this class is in We prove that LCP can be processable by Lemke's algorithm if We find some conditions for which the solution set of LCP is bounded and stable under the -property. We propose an algorithm based on an interior point method to solve LCP given
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 · Advanced Optimization Algorithms Research · graph theory and CDMA systems
