Positive semidefinite matrices with a given sparsity pattern
From MaRDI portal
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
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- Completion of partial matrices to contractions
- Extensions of band matrices with band inverses
- 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 Functions on C ∗ -Algebras
- Positive definite completions of partial Hermitian matrices
- Schur products and matrix completions
- Subalgebras of \(C^ *\)-algebras
- Triangulated graphs and the elimination process
Cited in
(46)- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- COSMO: a conic operator splitting method for convex conic problems
- Chordal decomposition in operator-splitting methods for sparse semidefinite programs
- Decomposition of arrow type positive semidefinite matrices with application to topology optimization
- Decomposition methods for sparse matrix nearness problems
- Spectrahedral cones generated by rank \(1\) matrices
- Linear optimization over homogeneous matrix cones
- Exploiting term sparsity in noncommutative polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- CS-TSSOS: correlative and term sparsity for large-scale polynomial optimization
- Sum-of-squares chordal decomposition of polynomial matrix inequalities
- Nonchordal positive semidefinite stochastic matrices∗
- Digital Simulation of Single Qubit Markovian Open Quantum Systems: A Tutorial
- Minimal separators of 2-chordal graphs
- Research problem: The completion number of a graph
- The positive definite completion problem revisited
- Sparse matrix decompositions and graph characterizations
- Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
- Extremal positive semidefinite doubly stochastic matrices
- A panorama of positivity. II: Fixed dimension
- Extremal rays and duals for cones of positive definite matrices with prescribed zeros
- Critical exponents of graphs
- Maximum likelihood threshold and generic completion rank of graphs
- Extremal bipartite matrices
- Matrices attaining the minimum semidefinite rank of a chordal graph
- Convex hulls of monomial curves, and a sparse positivstellensatz
- Decomposed structured subsets for semidefinite and sum-of-squares optimization
- Exploiting sparsity in complex polynomial optimization
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- The critical exponent: a novel graph invariant
- Memory-efficient structured convex optimization via extreme point sampling
- Do sums of squares dream of free resolutions?
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
- Graphs with sparsity order at most two: the complex case
- Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- On representing the positive semidefinite cone using the second-order cone
- Sparse sums of squares on finite abelian groups and improved semidefinite lifts
- Chordal sparsity for SDP-based neural network verification
- Extermal positive semidefinite matrices with given sparsity pattern
- Preserving positivity for matrices with sparsity constraints
- Learning chordal extensions
- On the sparsity order of a graph and its deficiency in chordality
- Sparse polynomial optimisation for neural network verification
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)
