Grothendieck inequalities for semidefinite programs with rank constraint

DOI10.4086/toc.2014.v010a004zbMath1297.68261arXiv1011.1754OpenAlexW2105974301MaRDI QIDQ3191609

Jop Briët, Fernando Mário de Oliveira Filho, Frank Vallentin

Publication date: 6 October 2014

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

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

zbMATH Keywords

randomized roundingGrothendieck inequality\(n\)-vector modelXOR games

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation algorithms (68W25) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (12)

Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ Krivine schemes are optimal ⋮ On the largest Bell violation attainable by a quantum state ⋮ Computing the Grothendieck constant of some graph classes ⋮ Unnamed Item ⋮ A generalized Grothendieck inequality and nonlocal correlations that require high entanglement ⋮ Spectral bounds for the independence ratio and the chromatic number of an operator ⋮ Grothendieck’s Theorem, past and present ⋮ Tightness of the maximum likelihood semidefinite relaxation for angular synchronization ⋮ Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Grothendieck constant is norm of Strassen matrix multiplication tensor

Uses Software

• PARI/GP

Cites Work

• On the Shannon capacity of a graph

This page was built for publication: Grothendieck inequalities for semidefinite programs with rank constraint