𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sign-solvable linear complementarity problems

✍ Scribed by Naonori Kakimura


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
143 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


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.


πŸ“œ SIMILAR VOLUMES


Solvability of implicit complementarity
✍ Yeol Je Cho; Jun Li; Nan-jing Huang πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 233 KB

In this paper, we introduce some new notions of (Ξ±, Ξ³ )-exceptional family of elements (in short, (Ξ±, Ξ³ )-(EFE)) and (Ξ±, Ξ², Ξ³ )-exceptional family of elements (in short, (Ξ±, Ξ², Ξ³ )-(EFE)) for a pair of continuous functions involved in the implicit complementarity problem (in short, ICP). Based upon

EP theorems and linear complementarity p
✍ Komei Fukuda; Makoto Namiki; Akihisa Tamura πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 809 KB

Let A be a rational n x n square matrix and b be a rational n-vector for some positive integer n. The linear complementarity prnhlem (abbreviated by LCP) is to find a vector (x, y) E R2" satisfying y = Ax + b (x, y) > 0 and the complementarity condition: X! yl = 0 for all i = 1,. , n. The LCP is kn