Fully copositive matrices
From MaRDI portal
Publication:1290628
Recommendations
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3432469 (Why is no real title available?)
- scientific article; zbMATH DE number 3332062 (Why is no real title available?)
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- A finite characterization ofK-matrices in dimensions less than four
- 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
- Some Properties of Fully Semimonotone, $Q_0 $-Matrices
- The Linear Complementarity Problem
Cited in
(10)- On the classes of fully copositive and fully semimonotone matrices
- Constructing copositive matrices from interior matrices
- On almost semimonotone matrices with non-positive off-diagonal elements and their generalizations
- On fully semimonotone matrices
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- 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
- Strictly copositive matrices and ESS's
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)