Efficient Rounding for the Noncommutative Grothendieck Inequality

DOI10.4086/toc.2014.v010a011zbMath1302.68323DBLPjournals/toc/NaorRV14arXiv1210.7656OpenAlexW2399198078WikidataQ59792634 ScholiaQ59792634MaRDI QIDQ3191601

Thomas Vidick, Assaf Naor, Oded Regev

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.7656

zbMATH Keywords

semidefinite programmingprincipal component analysisrounding procedureGrothendieck inequalityapproximation procedures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Semidefinite programming (90C22) Approximation algorithms (68W25)

Related Items (4)

Failure of the trilinear operator space Grothendieck theorem ⋮ Norms of structured random matrices ⋮ Unnamed Item ⋮ Polynomial and multilinear Hardy-Littlewood inequalities: analytical and numerical approaches

Cites Work

• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

This page was built for publication: Efficient Rounding for the Noncommutative Grothendieck Inequality