A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices

DOI10.1016/0024-3795(86)90264-8zbMath0602.15015OpenAlexW1990321007MaRDI QIDQ1081665

K. G. Ramamurthy

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0024-3795(86)90264-8

zbMATH Keywords

linear complementarity problempolynomial algorithmprincipal minorsLemke's algorithmZ-matrix

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Positive matrices and their generalizations; cones of matrices (15B48) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items

The Boolean pivot operation, \(M\)-matrices, and reducible matrices ⋮ On testing nonnegativity of principal minors of \({\mathbf{Z}} \)-matrices using simplex method ⋮ Finiteness of Criss-Cross Method in Complementarity Problem ⋮ Unnamed Item ⋮ A polynomial-time test for M-matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A review of an optimization problem
• On the simplex method and a class of linear complementarity problems
• Bimatrix Equilibrium Points and Mathematical Programming
• The Linear Complementarity Problem
• Depth-First Search and Linear Graph Algorithms