# Symmetric Grothendieck inequality

We establish an analogue of the Grothendieck inequality where the rectangular matrix is replaced by a symmetric/Hermitian matrix and the bilinear form by a quadratic form. We call this the symmetric Grothendieck inequality; despite its name, it is a generalization – the original Grothendieck inequality is a special case. While there are other proposals for such an inequality, ours differs in two important ways: (i) we have no additional requirement like positive semidefiniteness; (ii) our symmetric Grothendieck constant is universal, i.e., independent of the matrix and its dimensions. A consequence of our symmetric Grothendieck inequality is a "conic Grothendieck inequality" for any family of cones of symmetric matrices: The original Grothendieck inequality is a special case; as is the Nesterov π/2-Theorem, which corresponds to the cones of positive semidefinite matrices; as well as the Goemans-Williamson inequality, which corresponds to the cones of Laplacians. For yet other cones, e.g., of diagonally dominant matrices, we get new Grothendieck-like inequalities. A slight extension leads to a unified framework that treats any Grothendieck-like inequality as an inequality between two norms within a family of "Grothendieck norms" restricted to a family of cones. This allows us to place on equal footing the Goemans-Williamson inequality, Nesterov π/2-Theorem, Ben-Tal-Nemirovski-Roos 4/π-Theorem, generalized Grothendieck inequality, order-p Grothendieck inequality, rank-constrained positive semidefinite Grothendieck inequality; and in turn allows us to simplify proofs, extend results from real to complex, obtain new bounds or establish sharpness of existing ones. The symmetric Grothendieck inequality may also be applied to obtain polynomial-time approximation bounds for NP-hard combinatorial, integer, and nonconvex optimization problems.

## Authors

• 4 publications
• 12 publications
• ### A matrix concentration inequality for products

We present a non-asymptotic concentration inequality for the random matr...
08/12/2020 ∙ by Sina Baghal, et al. ∙ 0

• ### Variational Representations related to Quantum Rényi Relative Entropies

In this note, we focus on the variational representations of some matrix...
11/11/2019 ∙ by Guanghua Shi, et al. ∙ 0

• ### Quantitative form of Ball's Cube slicing in ℝ^n and equality cases in the min-entropy power inequality

We prove a quantitative form of the celebrated Ball's theorem on cube sl...
09/08/2021 ∙ by James Melbourne, et al. ∙ 0

• ### Matrix Infinitely Divisible Series: Tail Inequalities and Applications in Optimization

In this paper, we study tail inequalities of the largest eigenvalue of a...
09/04/2018 ∙ by Chao Zhang, et al. ∙ 0

• ### Linear Matrix Inequality Approaches to Koopman Operator Approximation

The regression problem associated with finding a matrix approximation of...
02/06/2021 ∙ by Steven Dahdah, et al. ∙ 0

• ### Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems

Consider a Markov process with state space [k], which jumps continuously...
05/11/2020 ∙ by Yuzhou Gu, et al. ∙ 0