More on hidden Z-matrices and linear complementarity problem

  title={More on hidden Z-matrices and linear complementarity problem},
  author={R. Jana and A. Dutta and A. K. Das},
  journal={Linear and Multilinear Algebra},
  pages={1151 - 1160}
ABSTRACT 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. We establish a result related to singular hidden Z-matrix. We show that for a non-degenerate feasible basis, linear complementarity problem with hidden Z-matrix has unique non-degenerate solution under some assumptions. The purpose of this paper is to study some properties of hidden Z… 
On Some Properties of $K$- type Block Matrices in the context of Complementarity Problem
In this article we introduceK-type block matrices which include two new classes of block matrices namely block triangularK-matrices and hidden block triangular K-matrices. We show that the solution
On Column Competent Matrices and Linear Complementarity Problem
Abstract We revisit the class of column competent matrices and study some matrix theoretic properties of this class. The local w-uniqueness of the solutions to the linear complementarity problem can
Bounded Homotopy Path Approach to Find the Solution of Linear Complementarity Problems
In this article, we introduce a new homotopy function to trace the trajectory by applying modified homotopy continuation method for finding the solution of the Linear Complementarity Problem. Earlier


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
Hidden Z-matrices with positive principal minors☆
Properties of some matrix classes based on principal pivot transform
  • A. K. Das
  • Mathematics, Computer Science
    Ann. Oper. Res.
  • 2016
It is shown that a subclass of almost fully copositive matrices intorduced in (Linear Algebra Appl 400:243–252 2005) with $$Q_{0}$$Q0-property is captured by sufficient matrices introduced by Cottle et al.
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
Finiteness of Criss-Cross Method in Complementarity Problem
The criss-cross method is able to compute solution of a linear complementarity problem in finite steps in case of some new matrix classes and a numerical illustration is presented to show a comparison between criss -cross method and Lemke's algorithm with respect to number of iterations before finding a solution.
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Now welcome, the most inspiring book today from a very professional writer in the world, a unified approach to interior point algorithms for linear complementarity problems lecture notes in computer
On Generalized Positive Subdefinite Matrices and Interior Point Algorithm
In this paper, we propose an iterative and descent type interior point method to compute solution of linear complementarity problem LCP(q, A) given that A is real square matrix and q is a real