A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
type: Item
instance of: scholarly article
title: A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
zbMATH Open document ID: 0602.15015
DOI: 10.1016/0024-3795(86)90264-8
author: K. G. Ramamurthy
published in: Linear Algebra and its Applications
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 15B48
Mathematics Subject Classification ID: 15B57
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65F30
zbMATH DE Number: 3970949
zbMATH Keywords: Lemke's algorithm
zbMATH Keywords: linear complementarity problem
zbMATH Keywords: Z-matrix
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: principal minors
MaRDI profile type: Publication
full work available at URL: 0024-3795(86)90264-8
OpenAlex ID: W1990321007
cites work: Q3932576
cites work: Q3943082
cites work: The Linear Complementarity Problem
cites work: Q5340130
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: On the simplex method and a class of linear complementarity problems
cites work: Q4039868
cites work: A review of an optimization problem
cites work: Depth-First Search and Linear Graph Algorithms
description: scientific article; zbMATH DE number 3970949