Efficient rounding for the noncommutative grothendieck inequality

DOI10.1145/2488608.2488618zbMath1293.68151OpenAlexW2050991582WikidataQ59792696 ScholiaQ59792696MaRDI QIDQ5495777

Thomas Vidick, Assaf Naor, Oded Regev

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20140910-115031387

zbMATH Keywords

semidefinite programmingrounding algorithmrobust principal component analysisGrothendieck inequality

Mathematics Subject Classification ID

Semidefinite programming (90C22) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (9)

Approximating the little Grothendieck problem over the orthogonal and unitary groups ⋮ Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method ⋮ The geometry of synchronization problems and learning group actions ⋮ Disentangling orthogonal matrices ⋮ Quantum XOR Games ⋮ Semidefinite Descriptions of the Convex Hull of Rotation Matrices ⋮ Non-unique games over compact groups and orientation estimation in cryo-EM ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming ⋮ Gaussian Process Landmarking for Three-Dimensional Geometric Morphometrics

This page was built for publication: Efficient rounding for the noncommutative grothendieck inequality