The Positive Semidefinite Grothendieck Problem with Rank Constraint

DOI10.1007/978-3-642-14165-2_4zbMath1287.68178arXiv0910.5765OpenAlexW1547393877MaRDI QIDQ3587367

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

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (9)

Grothendieck-Type Inequalities in Combinatorial Optimization ⋮ Approximating the little Grothendieck problem over the orthogonal and unitary groups ⋮ On the largest Bell violation attainable by a quantum state ⋮ A generalized Grothendieck inequality and nonlocal correlations that require high entanglement ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Grothendieck’s Theorem, past and present ⋮ Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs ⋮ Grothendieck constant is norm of Strassen matrix multiplication tensor

This page was built for publication: The Positive Semidefinite Grothendieck Problem with Rank Constraint