Hidden Z-matrices with positive principal minors
type: Item
instance of: scholarly article
title: Hidden Z-matrices with positive principal minors
zbMATH Open document ID: 0413.15011
DOI: 10.1016/0024-3795(79)90103-4
author: Jong-Shi Pang
published in: Linear Algebra and its Applications
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 15B57
Mathematics Subject Classification ID: 15B48
zbMATH DE Number: 3641634
zbMATH Keywords: class of real square matrices having positive principal minors
zbMATH Keywords: hidden Z- matrices
MaRDI profile type: Publication
full work available at URL: 0024-3795(79)90103-4
OpenAlex ID: W1970531462
cites work: Note on a Fundamental Theorem in Quadratic Programming
cites work: Q3944364
cites work: Manifestations of the Schur complement
cites work: Complementary pivot theory of mathematical programming
cites work: Q3908771
cites work: On the solution of large, structured linear complementarity problems: the block partitioned case
cites work: On solving linear complementarity problems as linear programs
cites work: On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
cites work: On the solution of large, structured linear complementarity problems: The tridiagonal case
cites work: Polyhedral sets having a least element
cites work: Applications of M-matrices to non-negative matrices
cites work: Optimal Solution of a Dynamic Leontief Model with Substitution
cites work: Q3844775
cites work: Q3881646
cites work: Q5340130
cites work: Some generalizations of positive definiteness and monotonicity
cites work: The factorization approach to large-scale linear programming
cites work: Isotone solutions of parametric linear complementarity problems
cites work: A linear complementarity problem with an n by 2n “P”-matrix
cites work: Q4077718
cites work: Linear complementarity problems solvable by A single linear program
cites work: Characterizations of bounded solutions of linear complementarity problems
cites work: Characterization of linear complementarity problems as linear programs
cites work: Nonnegative Matrices whose Inverses are M-Matrices
cites work: On the simplex method and a class of linear complementarity problems
cites work: Q5661059
cites work: On the convergence of a basic iterative method for the implicit complementarity problem
cites work: Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem
cites work: A note on an open problem in linear complementarity
cites work: More results on the convergence of iterative methods for the symmetric linear complementarity problem
cites work: M-matrix characterizations. I: nonsingular M-matrices
cites work: A Partition Theorem for Euclidean n-Space
cites work: An Inequality for Latent Roots Applied To Determinants with Dominant Principal Diagonal
cites work: On recurring theorems on diagonal dominance
cites work: Extreme points of Leontief substitution systems
description: scientific article; zbMATH DE number 3641634