English

Convex hulls of monomial curves, and a sparse positivstellensatz

Optimization and Control 2023-03-08 v1 Algebraic Geometry Operator Algebras

Abstract

Consider the closed convex hull KK of a monomial curve given parametrically as (tm1,,tmn)(t^{m_1},\ldots,t^{m_n}), with the parameter tt varying in an interval II. We show, using constructive arguments, that KK admits a lifted semidefinite description by O(d)\mathcal{O}(d) linear matrix inequalities (LMIs), each of size n2+1\left\lfloor \frac{n}{2} \right\rfloor +1, where d=max{m1,,mn}d= \max \{m_1,\ldots,m_n\} is the degree of the curve. On the dual side, we show that if a univariate polynomial p(t)p(t) of degree dd with at most 2k+12k+1 monomials is non-negative on R+\mathbb{R}_+, then pp admits a representation p=t0σ0++tdkσdkp = t^0 \sigma_0 + \cdots + t^{d-k} \sigma_{d-k}, where the polynomials σ0,,σdk\sigma_0,\ldots,\sigma_{d-k} are sums of squares and deg(σi)2k\operatorname{deg} (\sigma_i) \le 2k. The latter is a univariate positivstellensatz for sparse polynomials, with non-negativity of pp being certified by sos polynomials whose degree only depends on the sparsity of pp. Our results fit into the general attempt of formulating polynomial optimization problems as semidefinite problems with LMIs of small size. Such small-size descriptions are much more tractable from a computational viewpoint.

Keywords

Cite

@article{arxiv.2303.03826,
  title  = {Convex hulls of monomial curves, and a sparse positivstellensatz},
  author = {Gennadiy Averkov and Claus Scheiderer},
  journal= {arXiv preprint arXiv:2303.03826},
  year   = {2023}
}