Add to ORKGhtmlabstractGrothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the integrality gap between two optimization problems: A difficult semidefinite program with rank-1 constraint and its easy semidefinite relaxation where the rank constrained is dropped. For instance, the integrality gap of the Goemans-Williamson approximation algorithm for MAX CUT can be seen as a Grothendieck inequality. In this paper we consider Grothendieck inequalities for ranks greater than 1 and we give one application in statistical mechanics: Approximating ground states in the n-vector model
Abstract: The classical Grothendieck inequality has applications to the design of ap-proximation alg...
Abstract. We survey connections of the Grothendieck inequality and its variants to com-binatorial op...
Abstract. The (real) Grothendieck constant KG is the infimum over those K ∈ (0,∞) such that for ever...
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of ma...
textabstractGrothendieck inequalities are fundamental inequalities which are frequently used in many...
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of ma...
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of ma...
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positi...
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positi...
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positi...
Given a graph G = (V;E), consider the following problem: The input is a function A: E! R, and the go...
Given a graph G = ([n],E) and w ∈ R^E, consider the integer program max x∈{±1}^n \sum_{ij∈E} w_{ij} ...
Given a graph G = ([n],E) and w ∈ R^E, consider the integer program max x∈{±1}^n \sum_{ij∈E} w_{ij} ...
In this thesis we investigate combinatorial conditions that guarantee the existence of low-rank opti...
In this thesis we investigate combinatorial conditions that guarantee the existence of low-rank opti...
Abstract: The classical Grothendieck inequality has applications to the design of ap-proximation alg...
Abstract. We survey connections of the Grothendieck inequality and its variants to com-binatorial op...
Abstract. The (real) Grothendieck constant KG is the infimum over those K ∈ (0,∞) such that for ever...
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of ma...
textabstractGrothendieck inequalities are fundamental inequalities which are frequently used in many...
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of ma...
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of ma...
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positi...
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positi...
Given a positive integer n and a positive semidefinite matrix A = (A_{ij}) of size m x m, the positi...
Given a graph G = (V;E), consider the following problem: The input is a function A: E! R, and the go...
Given a graph G = ([n],E) and w ∈ R^E, consider the integer program max x∈{±1}^n \sum_{ij∈E} w_{ij} ...
Given a graph G = ([n],E) and w ∈ R^E, consider the integer program max x∈{±1}^n \sum_{ij∈E} w_{ij} ...
In this thesis we investigate combinatorial conditions that guarantee the existence of low-rank opti...
In this thesis we investigate combinatorial conditions that guarantee the existence of low-rank opti...
Abstract: The classical Grothendieck inequality has applications to the design of ap-proximation alg...
Abstract. We survey connections of the Grothendieck inequality and its variants to com-binatorial op...
Abstract. The (real) Grothendieck constant KG is the infimum over those K ∈ (0,∞) such that for ever...