Sign-solvable linear complementarity problems

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


This paper presents a connection between qualitative matrix theory and linear complementarity problems (LCPs). An LCP is said to be sign-solvable if the set of the sign patterns of the solutions is uniquely determined by the sign patterns of the given coefficients. We provide a characterization for sign-solvable LCPs such that the coefficient matrix has nonzero diagonals, which can be tested in polynomial time. This characterization leads to an efficient combinatorial algorithm to find the sign pattern of a solution for these LCPs. The algorithm runs in O (γ) time, where γ is the number of the nonzero coefficients.

Original languageEnglish
Pages (from-to)606-616
Number of pages11
JournalLinear Algebra and Its Applications
Issue number2-3
Publication statusPublished - 2008 Jul 15
Externally publishedYes


  • Linear complementarity problems
  • Qualitative matrix theory

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Numerical Analysis
  • Geometry and Topology
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Sign-solvable linear complementarity problems'. Together they form a unique fingerprint.

Cite this