The completely positive and doubly nonnegative completion problems

DOI10.1080/03081089808818550zbMath0911.15012OpenAlexW2007877379MaRDI QIDQ4208353

John H. Drew, Charles R. Johnson

Publication date: 28 April 1999

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

Full work available at URL: https://doi.org/10.1080/03081089808818550

zbMATH Keywords

symmetric matrixchordal graphcompletion problemscompletely positive matrixdoubly-nonnegative matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

SPN completable graphs, Note on subdirect sums of SDD(p) matrices, Note on subdirect sums of \(\{i_0\}\)-Nekrasov matrices, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization, The symmetric \(M\)-matrix and symmetric inverse \(M\)-matrix completion problems, The integer cp-rank of \(2 \times 2\) matrices, \(P\)-matrix completions under weak symmetry assumptions, The cycle completable graphs for the completely positive and doubly nonnegative completion problems, Sub-direct sums and positivity classes of matrices

Cites Work

• Unnamed Item
• Positive definite completions of partial Hermitian matrices
• Nonnegative factorization of completely positive matrices
• Nonnegative factorization of positive semidefinite nonnegative matrices
• Bipartite completely positive matrices
• Completely positive matrices associated withM-matrices