On the classes of fully copositive and fully semimonotone matrices
Reads0
Chats0
TLDR
In this paper, the authors considered the class C 0 f of fully copositive matrices and the class E 0f of fully semimonotone matrices, and they showed that the columns of these matrices with positive diagonal entries are column sufficient.About:
This article is published in Linear Algebra and its Applications.The article was published on 2001-01-15 and is currently open access. It has received 30 citations till now. The article focuses on the topics: Matrix (mathematics) & Counterexample.read more
Citations
More filters
Journal ArticleDOI
Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization
TL;DR: A systematic construction principle for non-attainability phenomena, which apparently has not been noted before in an explicit way is presented, and for the first time, a somehow systematic clustering of the vast and scattered literature is attempted.
Book ChapterDOI
Finiteness of Criss-Cross Method in Complementarity Problem
A. K. Das,R. Jana,Deepmala +2 more
TL;DR: 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.
Journal ArticleDOI
Properties of some matrix classes based on principal pivot transform
TL;DR: 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.
Journal ArticleDOI
Principal pivot transforms of some classes of matrices
S. K. Neogy,A. K. Das +1 more
TL;DR: In this paper, the authors study and characterize various classes of matrices that are defined based on principal pivot transforms and show that matrices in these classes have nonnegative principal minors.
Posted Content
On Semimonotone Star Matrices and Linear Complementarity Problem
R. Jana,A. K. Das,Sagnik Sinha +2 more
TL;DR: In this paper, the authors introduce the class of semimonotone star matrices and prove that the principal pivot transform of these matrices is not necessarily in general in general.
References
More filters
Book
The Linear Complementarity Problem
TL;DR: In this article, the authors present an overview of existing and multiplicity of degree theory and propose pivoting methods and iterative methods for degree analysis, including sensitivity and stability analysis.
Journal ArticleDOI
The Linear Complementarity Problem
TL;DR: In this article, it was shown that Lemke's algorithm will not solve the linear complementarity problem for a class of matrices, which properly includes copositive matrices with nonnegative principal minors, and matrices for bimatrix games.
Journal ArticleDOI
Sufficient matrices and the linear complementarity problem
TL;DR: In this paper, the authors introduce the class of column sufficient matrices, which are the transpose of a matrix M such that for every vector q, the solutions of the linear complementarity problem are identical to the Karush-Kuhn-Tucker points associated with ( q, M ).
Journal ArticleDOI
On classes of copositive matrices
TL;DR: In this paper, characterizations of copositive plus matrices are given, together with relationships of these matrices with positive semidefinite matrices and their quadratic forms.