On hidden Z-matrices and the linear complementarity problem

@article{Dubey2016OnHZ,
  title={On hidden Z-matrices and the linear complementarity problem},
  author={Dipti Dubey and S. K. Neogy},
  journal={Linear Algebra and its Applications},
  year={2016},
  volume={496},
  pages={81-100}
}
  • D. Dubey, S. K. Neogy
  • Published 1 May 2016
  • Computer Science, Mathematics
  • Linear Algebra and its Applications
More on hidden Z-matrices and linear complementarity problem
TLDR
It is shown that for a non-degenerate feasible basis, linear complementarity problem with hidden Z-matrix has unique non- Degenerate solution under some assumptions.
On Linear Complementarity Problem with Hidden Z-Matrix
In this article we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Pták for the linear system in complementarity problem using game theoretic approach.
O C ] 3 0 M ay 2 01 9 More On Hidden Z-Matrices and Linear Complementarity Problem
In this article we study linear complementarity problem with hidden Z-matrix. We extend the results of Fiedler and Pták for the linear system in complementarity problem using game theoretic approach.
A Unified Framework for a Class of Mathematical Programming Problems
In this chapter, we study various mathematical programming problems in a common framework known as linear complementarity problem. Solving a linear complementarity problem depends on the properties
Linear System with Hidden $Z$-Matrix and Complementary Condition
In this article we study a class of linear system formed by hidden $Z$-matrix with complementary condition. We extend the results of Fiedler and Pt{\'a}k for the linear system with complementary

References

SHOWING 1-10 OF 27 REFERENCES
Ky Fan's N-matrices and linear complementarity problems
TLDR
It is shown that if A is a Z-matrix, then A is an F-matrices if and only if LCP(q, A) has exactly two solutions for anyq⩾0,q≠0, and has at most two solutionsFor any otherq.
Pivoting Algorithms for Some Classes of Stochastic Games: a Survey
In this paper, we survey the recent literature on computing the value vector and the associated optimal strategies of the players for special cases of zero-sum stochastic games, or in computing a
The Linear Complementarity Problem with Exact Order Matrices
TLDR
A complete characterization of the class of exact order 1 based on the number of solutions to the LCPq, A for each q ∈ Rn is presented.
A constructive characterization ofQo-matrices with nonnegative principal minors
TLDR
This work constructively characterize the matrix class known as Qo∩Po, which gives a finitely testable set of necessary and sufficient conditions under which a matrix with nonnegative principal minors has the property that if a corresponding linear complementarity problem is feasible then it is solvable.
Linear complementarity problems solvable by A single linear program
It is shown that the linear complementarity problem of finding az inRn such thatMz + q ⩾ 0, z ⩾ 0 andzT(Mz + q) = 0 can be solved by a single linear program in some important special cases including
On almost type classes of matrices with Q-property
In this article, we introduce a new matrix class almost (a subclass of almost N 0-matrices which are obtained as a limit of a sequence of almost N-matrices) and obtain a sufficient condition for this
...
...