Positive semidefinite matrices with a given sparsity pattern
From MaRDI portal
Given a sparsity pattern, the cone of positive matrices which have zero in prescribed entries is considered. The highest rank of the extremal matrices in the cone is called the order of pattern. The order is linked with graph properties of the pattern. It leads to a classification of certain subgraphs of the pattern.
Recommendations
- The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
- Extermal positive semidefinite matrices with given sparsity pattern
- A note on the positive semidefinite minimum rank of a sign pattern matrix
- On the sparsity order of a graph and its deficiency in chordality
- Sparsity Patterns with High Rank Extremal Positive Semidefinite Matrices
Cites work
- Completion of partial matrices to contractions
- Extensions of band matrices with band inverses
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Inertia possibilities for completions of partial hermitian matrices*
- Inverses of banded matrices
- Invertible Selfadjoint Extensions of Band Matrices and Their Entropy
- Norm-Preserving Dilations and Their Applications to Optimal Error Bounds
- On Spectral Permanence for Certain Banach Algebras
- Positive definite completions of partial Hermitian matrices
- Positive Functions on C ∗ -Algebras
- Schur products and matrix completions
- Subalgebras of C^ *-algebras
- Triangulated graphs and the elimination process
Cited in
(55)- On the sparsity order of a graph and its deficiency in chordality
- Maximum likelihood threshold and generic completion rank of graphs
- The critical exponent: a novel graph invariant
- Extremal bipartite matrices
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Learning chordal extensions
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Exploiting sparsity in complex polynomial optimization
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Exploiting term sparsity in noncommutative polynomial optimization
- COSMO: a conic operator splitting method for convex conic problems
- Decomposition of arrow type positive semidefinite matrices with application to topology optimization
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Minimal separators of 2-chordal graphs
- On representing the positive semidefinite cone using the second-order cone
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Preserving positivity for matrices with sparsity constraints
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- A panorama of positivity. II: Fixed dimension
- The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts
- Decomposition methods for sparse matrix nearness problems
- Matrices attaining the minimum semidefinite rank of a chordal graph
- Nonchordal positive semidefinite stochastic matrices∗
- Sparse matrix decompositions and graph characterizations
- 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
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Memory-efficient structured convex optimization via extreme point sampling
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- Do sums of squares dream of free resolutions?
- Research problem: The completion number of a graph
- Spectrahedral cones generated by rank \(1\) matrices
- Linear optimization over homogeneous matrix cones
- Sparse polynomial optimisation for neural network verification
- Chordal sparsity for SDP-based neural network verification
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Convex hulls of monomial curves, and a sparse positivstellensatz
- Lectures on nonnegative polynomials and sums of squares
- Minimal hyperbolic polynomials and ranks of homogeneous cones
- Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
- Matrix completion and decomposition in phase-bounded cones
- The factor width rank of a matrix
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Sparse polynomial matrix optimization
- Convergence of the sum-of-squares hierarchy for quadratic optimization over roots-of-unity
- Extremal positive semidefinite doubly stochastic matrices
- Extremal rays and duals for cones of positive definite matrices with prescribed zeros
- Critical exponents of graphs
- The positive definite completion problem revisited
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
This page was built for publication: Positive semidefinite matrices with a given sparsity pattern
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109100)
