Low-Rank PSD Approximation in Input-Sparsity Time

DOI10.1137/1.9781611974782.134zbMath1411.68186OpenAlexW4250224698MaRDI QIDQ4575882

David P. Woodruff, Kenneth L. Clarkson

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974782.134

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms (68W40) Positive matrices and their generalizations; cones of matrices (15B48) Approximation algorithms (68W25)

Related Items (3)

Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ Random projections for conic programs ⋮ Randomized signal processing with continuous frames

This page was built for publication: Low-Rank PSD Approximation in Input-Sparsity Time