Criteria for sufficient matrices

DOI10.1016/0024-3795(94)00058-1zbMath0857.15019MaRDI QIDQ1906774

Hannu Väliaho

Publication date: 14 February 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00058-1

zbMATH Keywords

linear complementarity problem; Hadamard product; rank; sufficient matrix; \(P\)-matrix; principal pivoting

Mathematics Subject Classification ID

90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)

15B57: Hermitian, skew-Hermitian, and related matrices

15A03: Vector spaces, linear dependence, rank, lineability

Related Items

New criss-cross type algorithms for linear complementarity problems with sufficient matrices, On the classes of fully copositive and fully semimonotone matrices, More on positive subdefinite matrices and the linear complementarity problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The principal pivoting method revisited
• Sufficient matrices and the linear complementarity problem
• Two characterizations of sufficient matrices
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• Some generalizations of positive definiteness and monotonicity
• Complementary pivot theory of mathematical programming
• A combinatorial approach to convex quadratic programming
• On the uniqueness of solutions to linear complementarity problems
• Least-Index Resolution of Degeneracy in Linear Complementarity Problems with Sufficient Matrices
• A procedure for the one-parametric linear complementarity problem
• Bimatrix Equilibrium Points and Mathematical Programming
• Duality Theory of Linear Programs: A Constructive Approach with Applications