Completion problems for positive matrices with minimal rank
From MaRDI portal
Recommendations
- Positive extension and completion problems for a class of structured matrices
- scientific article; zbMATH DE number 523915
- The completion problem for N-matrices
- Minimizing the condition number of a positive definite matrix by completion
- scientific article; zbMATH DE number 5252256
- Minimal rank completions for block matrices
- On completion problems for various classes of \(P\)-matrices
- Complementarity problems and positive definite matrices
- Minimal rank completions of partial banded matrices
- The completion problem for M-matrices and inverse M-matrices
Cited in
(15)- Completely positive completion of partial matrices whose entries are completely bounded maps
- Minimal rank completions for block matrices
- Minimal rank completions for overlapping blocks
- Symmetric completions of cycles and bipartite graphs
- On the maximum rank of completions of entry pattern matrices
- Completing any low-rank matrix, provably
- The minimum rank completion problems for tri-diagonal partial full sign patterns
- Minimal rank completions of partial banded matrices
- The cyclic rank completion problem with regular blocks
- scientific article; zbMATH DE number 1413869 (Why is no real title available?)
- A minimal completion of (0,1)-matrices without total support
- scientific article; zbMATH DE number 5252256 (Why is no real title available?)
- Graph theoretic methods for matrix completion problems
- Contractive symmetric matrix completion problems related to graphs
- Extending partial tournaments
This page was built for publication: Completion problems for positive matrices with minimal rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657080)
