Related papers: Positive Univariate Polynomials: SOS certificates,…
Let $S=\{p_1,\dots,p_s\}$ be a finite non-empty set of distinct prime numbers, let $f\in \mathbb{Z}[X]$ be a polynomial of degree $n\ge 1$, and let $S'\subseteq S$ be the subset of all $p\in S$ such that $f$ has a root in $\mathbb{Z}_p$.…
The Unbounded Subset-Sum Problem (USSP) is defined as: given sum $s$ and a set of integers $W\leftarrow \{p_1,\dots,p_n\}$ output a set of non-negative integers $\{y_1,\dots,y_n\}$ such that $p_1y_1+\dots+p_ny_n=s$. The USSP is an…
A non-negativity certificate (NNC) is a way to write a polynomial so that its non-negativity on a semialgebraic set becomes evident. Positivstellens\"atze (Ps\"atze) guarantee the existence of NNCs. Both, NNCs and Ps\"atze underlie powerful…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
Global optimization has gained attraction over the past decades, thanks to the development of both theoretical foundations and efficient numerical routines. Among recent advances, Kernel Sum of Squares (KernelSOS) provides a powerful…
This paper is a survey of plurisubharmonic theory where the usual polynomial ring is replaced by a polynomial ring $\mathcal P^S(\mathbb C^n)$ where the $m$-th degree polynomials have exponents restricted to $mS$, where $S\subseteq \mathbb…
Below we discuss the partition of the space of real univariate polynomials according to the number of positive and negative roots and signs of the coefficients. We present several series of non-realizable combinations of signs together with…
A well-known theorem of Quillen says that if $r(z,\bar{z})$ is a bihomogeneous polynomial on ${\mathbb{C}}^n$ positive on the sphere, then there exists $d$ such that $r(z,\bar{z}){\lVert z \rVert}^{2d}$ is a squared norm. We obtain…
This paper introduces a notion of decomposition and completion of sum-of-squares (SOS) matrices. We show that a subset of sparse SOS matrices with chordal sparsity patterns can be equivalently decomposed into a sum of multiple SOS matrices…
We study planted problems---finding hidden structures in random noisy inputs---through the lens of the sum-of-squares semidefinite programming hierarchy (SoS). This family of powerful semidefinite programs has recently yielded many new…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
A central question in optimization is to maximize (or minimize) a linear function over a given polytope P. To solve such a problem in practice one needs a concise description of the polytope P. In this paper we are interested in…
This paper is devoted to the problem of minimizing a sum of rational functions over a basic semialgebraic set. We provide a hierarchy of sum of squares (SOS) relaxations that is dual to the generalized moment problem approach due to…
We compare four key hierarchies for solving Constrained Polynomial Optimization Problems (CPOP): Sum of Squares (SOS), Sum of Diagonally Dominant Polynomials (SDSOS), Sum of Nonnegative Circuits (SONC), and the Sherali Adams (SA)…
For any 4-variate quartic form $f\geq 0$ (i.e. $f$ nonnegative, homogeneous polynomial of degree $4$ with real coefficients) there exist quadratic forms $q$ and $q'$ so that $qq'f$ is a sum of squares (s.o.s.) of quartics, by reducing to…
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…
We investigate the question whether Subset Sum can be solved by a polynomial-time algorithm with access to a certificate of length poly(k) where k is the maximal number of bits in an input number. In other words, can it be solved using only…
Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…
We present an example of a strictly positive polynomial with rational coefficients that can be decomposed as a sum of squares of polynomials over $\R$ but not over $\Q$. This answers an open question by C. Scheiderer posed as the second…
We study SOS properties of biquadratic forms. For the class of partially symmetric biquadratic forms, we establish necessary and sufficient conditions for positive semi-definiteness and prove that every PSD partially symmetric biquadratic…