Good hidden P-matrix sandwiches

DOI10.1016/J.LAA.2007.05.004MaRDI QIDQ996290zbMATH OpenOpenAlexFDO

Authors Makoto Namiki, Walter Morris

Publication date 14 September 2007

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

Full work available at URL https://doi.org/10.1016/j.laa.2007.05.004

zbMATH Keywords

linear complementarity problemdiagonally dominant matrixhidden Minkowski matrix

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Recognition of hidden positive row diagonally dominant matrices
• On semimonotone matrices with nonnegative principal minors
• On some classes of matrices related to solving linear complementarity problems as linear programs
• On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
• The fibre of P-matrices: the recursive construction of all matrices with positive principal minors
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• A polynomial algorithm for testing the nonnegativity of principal minors of Z-matrices
• Generalizations of the hidden Minkowski property
• A recursive test for P-matrices
• N-matrices

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 3619645 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• CP-rays in simplicial cones
• Convex sets of nonsingular and P:–Matrices
• Geometric Properties of Hidden Minkowski Matrices
• Linear complementarity problems solvable by A single linear program
• Linear complementarity problems solvable by a polynomially bounded pivoting algorithm
• On total functions, existence theorems and computational complexity
• Recognition of hidden positive row diagonally dominant matrices
• Second-order cone programming
• The P-matrix problem is co-NP-complete

Cited in

(7)

• The fibre of P-matrices: the recursive construction of all matrices with positive principal minors
• Matrix sandwich problems
• On hidden \(Z\)-matrix and interior point algorithm
• On hidden \(\mathbf{Z}\)-matrices and the linear complementarity problem
• Combinatorial characterizations of \(K\)-matrices
• Geometric Properties of Hidden Minkowski Matrices
• Efficient computation of a canonical form for a matrix with the generalized P-property

This page was built for publication: Good hidden \(P\)-matrix sandwiches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q996290)