The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
From MaRDI portal
(Redirected from Publication:3348009)
Recommendations
Cited in
(20)- Positive semidefinite matrices with a given sparsity pattern
- More on extremal positive semidefinite doubly stochastic matrices
- One-step completions of Hermitian partial matrices with minimal negative signature
- On the sparsity order of a graph and its deficiency in chordality
- Extremal bipartite matrices
- Extreme rays and faces for the cone of class functions non-negative on the set of Gram matrices
- Minimal separators of 2-chordal graphs
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- Nonchordal positive semidefinite stochastic matrices∗
- Hereditary properties of matrices with cut-points
- Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices
- Extermal positive semidefinite matrices with given sparsity pattern
- Graphs with sparsity order at most two: the complex case
- Do sums of squares dream of free resolutions?
- Positive semidefinite rank and nested spectrahedra
- Research problem: The completion number of a graph
- Extremal positive semidefinite doubly stochastic matrices
- Extremal rays and duals for cones of positive definite matrices with prescribed zeros
- Extremal correlation matrices
- The positive definite completion problem revisited
This page was built for publication: The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348009)