Criteria for sufficient matrices

DOI10.1016/0024-3795(94)00058-1zbMath0857.15019OpenAlexW1982002079MaRDI 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 problemHadamard productranksufficient matrix\(P\)-matrixprincipal pivoting

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (10)

The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems ⋮ On the classes of fully copositive and fully semimonotone matrices ⋮ More on positive subdefinite matrices and the linear complementarity problem ⋮ Total dual integrality and integral solutions of the linear complementarity problem ⋮ On sufficient properties of sufficient matrices ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ New characterizations of row sufficient matrices ⋮ New criss-cross type algorithms for linear complementarity problems with sufficient matrices ⋮ Sufficiency of linear transformations on Euclidean Jordan algebras ⋮ On weak generalized positive subdefinite matrices and the linear complementarity problem

Cites Work

• 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
• On inverting partitioned matrices

This page was built for publication: Criteria for sufficient matrices