On the classes of fully copositive and fully semimonotone matrices
From MaRDI portal
Publication:5929759
DOI10.1016/S0024-3795(00)00247-0zbMath1046.15024MaRDI QIDQ5929759
S. K. Neogy, A. K. Das, S. R. Mohan
Publication date: 2001
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
linear complementarity problemcounterexamplefully copositive matricesfully semimonotone matricesprincipal pivot transform
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (10)
Properties of some matrix classes based on principal pivot transform ⋮ On semimonotone star matrices and linear complementarity problem ⋮ More on matrix splitting modulus-based iterative methods for solving linear complementarity problem ⋮ Finiteness of Criss-Cross Method in Complementarity Problem ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ ON FULLY SEMIMONOTONE MATRICES ⋮ Principal pivot transforms of some classes of matrices ⋮ Total dual integrality and integral solutions of the linear complementarity problem ⋮ On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem ⋮ On column competent matrices and linear complementarity problem
Cites Work
- The principal pivoting method revisited
- Criteria for copositive matrices
- Sufficient matrices and the linear complementarity problem
- Two characterizations of sufficient matrices
- Fully copositive matrices
- On strongly degenerate complementary cones and solution rays
- Criteria for sufficient matrices
- On classes of copositive matrices
- On Some Classes of Linear Complementarity Problems with Matrices of Order n and Rank (n − 1)
- On the uniqueness of solutions to linear complementarity problems
- Some perturbation results for the Linear Complementarity Problem
- Some Recent Results on The Linear Complementarity Problem
- On the Solution Sets of Linear Complementarity Problems
- Some Properties of Fully Semimonotone, $Q_0 $-Matrices
- A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming
- The Linear Complementarity Problem
- Unnamed Item
- Unnamed Item
This page was built for publication: On the classes of fully copositive and fully semimonotone matrices