Fully copositive matrices
From MaRDI portal
Publication:1290628
DOI10.1007/BF01580077zbMATH Open0922.90135MaRDI QIDQ1290628FDOQ1290628
Authors: G. S. R. Murthy, T. Parthasarathy 
Publication date: 18 October 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Linear Complementarity Problem
- Completely- matrices
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- On the uniqueness of solutions to linear complementarity problems
- Title not available (Why is that?)
- A finite characterization ofK-matrices in dimensions less than four
- Some Properties of Fully Semimonotone, $Q_0 $-Matrices
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
Cited In (9)
- Strictly copositive matrices and ESS's
- On almost semimonotone matrices with non-positive off-diagonal elements and their generalizations
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- On the classes of fully copositive and fully semimonotone matrices
- Constructing copositive matrices from interior matrices
- Preface: International conference on game theory and optimization, June 6--10, 2016, Indian Institute of Technology Madras, Chennai, India
- T. Parthasarathy's contributions to complementarity problems: a survey
- Finiteness of Criss-Cross Method in Complementarity Problem
- Principal pivot transforms of some classes of matrices
This page was built for publication: Fully copositive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290628)
