Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization

  title={Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization},
  author={Gennadiy Averkov},
  journal={SIAM J. Appl. Algebra Geom.},
  • G. Averkov
  • Published 22 June 2018
  • Mathematics
  • SIAM J. Appl. Algebra Geom.
The abbreviations LMI and SOS stand for `linear matrix inequality' and `sum of squares', respectively. The cone $\Sigma_{n,2d}$ of SOS polynomials in $n$ variables of degree at most $2d$ is known to have a semidefinite extended formulation with one LMI of size $\binom{n+d}{n}$. In other words, $\Sigma_{n,2d}$ is a linear image of a set described by one LMI of size $\binom{n+d}{n}$. We show that $\Sigma_{n,2d}$ has no semidefinite extended formulation with finitely many LMIs of size less than… 

Second-order cone representation for convex subsets of the plane

Semidefinite programming (SDP) is the task of optimizing a linear function over the common solution set of finitely many linear matrix inequalities (LMIs). For the running time of SDP solvers, the

Sublinear circuits and the constrained signomial nonnegativity problem

Conditional Sums-of-AM/GM-Exponentials (conditional SAGE) is a decomposition method to prove nonnegativity of a signomial or polynomial over some subset X of real space. In this article, we undertake

The $${\mathcal {S}}$$ S -cone and a primal-dual view on second-order representability

The $${\mathcal {S}}$$ S -cone provides a common framework for cones of polynomials or exponential sums which establish non-negativity upon the arithmetic-geometric inequality, in particular for sums

Limitations on the Expressive Power of Convex Cones without Long Chains of Faces

The main result says that whenever a convex cone has a certain neighborliness property, then it does not have a lifted representation using a finite product of cones, each of which has only short chains of faces.

The dual cone of sums of non-negative circuit polynomials

Abstract For a non-empty, finite subset A⊆N0n $\mathcal{A} \subseteq \mathbb{N}_0^n$ let Csonc(𝒜) ∈ ℝ[x1, . . . , xn] be the cone of sums of non-negative circuit polynomials with support 𝒜. We

A unified framework of SAGE and SONC polynomials and its duality theory

This work derives from the duality theory an approximation result of non-negative univariate polynomials and shows that a SONC analogue of Putinar's Positivstellensatz does not exist even in the univariate case.

Exploiting ideal-sparsity in the generalized moment problem with application to matrix factorization ranks

Numerical results show that the ideal-sparse bounds are often tighter and much faster to compute than their dense analogs, when applied to the problem of bounding nonnegative- and completely positive matrix factorization ranks.

Lifting for Simplicity: Concise Descriptions of Convex Sets

The connection between the existence of lifts of a convex set and certain structured factorizations of its associated slack operator is explained, and a uniform approach to the construction of spectrahedral lifts of convex sets is described.


A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone. Cones that are homogeneous and self-dual are called symmetric. Conic optimization problems over

Linear optimization over homogeneous matrix cones

A convex cone is homogeneous if its automorphism group acts transitively on the interior of the cone. Cones that are homogeneous and self-dual are called symmetric. Conic optimization problems over



Polynomial-sized semidefinite representations of derivative relaxations of spectrahedral cones

These representations allow us to use semidefinite programming to solve the linear cone programs associated with these convex cones as well as their (less well understood) dual cones.

Positive semidefinite rank

The main mathematical properties of psd rank are surveyed, including its geometry, relationships with other rank notions, and computational and algorithmic aspects.

Sparse sums of squares on finite abelian groups and improved semidefinite lifts

It is proved that any nonnegative quadratic form in n binary variables is a sum of squares of functions of degree at most, establishing a conjecture of Laurent.

Linear optimization with cones of moments and nonnegative polynomials

A convergent hierarchy of semidefinite relaxations is constructed for the cones of P(K), R(K) and RA (K) (like interiors, closeness, duality, memberships), and it is shown how to check whether the cones intersect affine subspaces and if they do, how to get a point in the intersections.

Lower bounds for a polynomial in terms of its coefficients

We determine new sufficient conditions in terms of the coefficients for a polynomial $${f\in \mathbb{R}[\underline{X}]}$$ of degree 2d (d ≥ 1) in n ≥ 1 variables to be a sum of squares of

Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies

A representation-theoretic framework is presented to study equivariant PSD lifts of a certain class of symmetric polytopes known as orbitopes which respect the symmetries of the polytope.

Maximum semidefinite and linear extension complexity of families of polytopes

This paper relates the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members and shows that the linear extension complex of every d-dimensional 0/1-polytope is bounded from above by O(2dd).

Lower Bounds on the Size of Semidefinite Programming Relaxations

It is proved that SDPs of polynomial-size are equivalent in power to those arising from degree-O(1) sum-of-squares relaxations, and this result yields the first super-polynomial lower bounds on the semidefinite extension complexity of any explicit family of polytopes.

Equivariant Semidefinite Lifts of Regular Polygons

This paper shows that one can construct an equivariant psd lift of the regular 2^n-gon of size 2n-1, which is exponentially smaller than the psd Lift of the sum-of-squares hierarchy, and proves that the construction is essentially optimal.