Sufficient matrices belong to \(L\).

DOI10.1007/s10107-005-0639-7zbMath1134.90507OpenAlexW2096136371MaRDI QIDQ2490342

Sushil Verma, Richard W. Cottle, Ilan Adler

Publication date: 2 May 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0639-7

Mathematics Subject Classification ID

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

Related Items

On semimonotone star matrices and linear complementarity problem, A field guide to the matrix classes found in the literature of the linear complementarity problem, New characterizations of row sufficient matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A copositive Q-matrix which is not \(R_ 0\)
• The principal pivoting method revisited
• Pseudomonotone and copositive star matrices
• 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
• \(Q\)-matrices and boundedness of solutions to linear complementarity problems
• On strongly degenerate complementary cones and solution rays
• On a subclass of \(P_ 0\)
• \(P_ *\)-matrices are just sufficient
• On a class of semimonotone \(Q_ 0\)-matrices in the linear complementarity problem
• A constructive characterization ofQ o-matrices with nonnegative principal minors
• Characterizations of bounded solutions of linear complementarity problems
• On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem
• The Generalized Order Linear Complementarity Problem
• 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
• The complementarity problem