Sparse Sums of Positive Semidefinite Matrices
From MaRDI portal
Publication:4962206
DOI10.1145/2746241zbMath1398.68655arXiv1107.0088OpenAlexW3125317651MaRDI QIDQ4962206
Nicholas J. A. Harvey, Cristiane M. Sato, Marcel Kenji De Carli Silva
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.0088
Laplacian matrixrandomized algorithmsderandomizationpositive semidefinite matricesspectral sparsifiers
Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Positive matrices and their generalizations; cones of matrices (15B48) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving, Finding Sparse Solutions for Packing and Covering Semidefinite Programs, A Spectral Approach to Network Design, Extracting a basis with fixed block inside a matrix, Unnamed Item, Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs, Toward a spectral theory of cellular sheaves, Approximation of the average of some random matrices, Sparsification of Two-Variable Valued Constraint Satisfaction Problems