New characterizations of row sufficient matrices
From MaRDI portal
Publication:1020925
DOI10.1016/j.laa.2009.01.010zbMath1170.90497OpenAlexW2162158997MaRDI QIDQ1020925
Sushil Verma, Ilan Adler, Richard W. Cottle
Publication date: 4 June 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.01.010
Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Linear inequalities of matrices (15A39) Quadratic and bilinear forms, inner products (15A63)
Related Items
On generalizations of positive subdefinite matrices and the linear complementarity problem, On weak generalized positive subdefinite matrices and the linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- The principal pivoting method revisited
- A field guide to the matrix classes found in the literature of the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Two characterizations of sufficient matrices
- On a subclass of \(P_ 0\)
- Criteria for sufficient matrices
- \(P_ *\)-matrices are just sufficient
- Sufficient matrices belong to \(L\).
- Some generalizations of positive definiteness and monotonicity
- Complementary pivot theory of mathematical programming
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- A constructive characterization ofQ o-matrices with nonnegative principal minors
- Some classes of matrices in linear complementarity theory
- Some Properties of Fully Semimonotone, $Q_0 $-Matrices
- Bimatrix Equilibrium Points and Mathematical Programming
- The Linear Complementarity Problem
