Related papers: Real Zeros of SONC Polynomials
We describe a new approach to certifying the global nonnegativity of multivariate polynomials by solving hyperbolic optimization problems---a class of convex optimization problems that generalize semidefinite programs. We show how to…
We observe that the E-resultant of a very ample rank 2 vector bundle E on a real projective curve (with no real points) is nonnegative when restricted to the space of real sections. Moreover, we show that if E has a section vanishing at…
As was detailed by Loewy and London in [Linear and Multilinear Algebra 6 (1978/79), no.~1, 83--90], the cone of polynomials that preserve the nonnegativity of matrices may play an important role in the solution to the nonnegative inverse…
Assessing non-negativity of multivariate polynomials over the reals, through the computation of {\em certificates of non-negativity}, is a topical issue in polynomial optimization. This is usually tackled through the computation of {\em…
For $n,d\in\mathbb{N}$, the cone $\mathcal{P}_{n+1,2d}$ of positive semi-definite (PSD) $(n+1)$-ary $2d$-ic forms (i.e., homogeneous polynomials with real coefficients in $n+1$ variables of degree $2d$) contains the cone $\Sigma_{n+1,2d}$…
A novel method with two variations is proposed with which the number of positive and negative zeros of a polynomial with real coefficients and degree $n$ can be restricted with significantly better determinacy than that provided by the…
In this paper we study the cones corresponding to sums of squares of $n$-ary $d$-ic forms with at most $k$ terms. We show that these are strictly nested as $k$ increases, leading to the usual sum of squares cone. We also discuss the duals…
For a set $S$ of $d$ points in the $n$-dimensional projective space over a field of characteristic zero, we prove that the polynomials of degree $d$ whose zero sets are cones over $S$ do not span the vector space of polynomials of degree…
There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…
Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…
We initiate a systematic study of nonnegative polynomials $P$ such that $P^k$ is not a sum of squares for any odd $k\geq 1$, calling such $P$ \emph{stubborn}. We develop a new invariant of a real isolated zero of a nonnegative polynomial in…
In this article we develop new methods for exhibiting convex semialgebraic sets that are not spectrahedral shadows. We characterize when the set of nonnegative polynomials with a given support is a spectrahedral shadow in terms of sums of…
Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…
We prove that there is an absolute constant $c > 0$ such that every polynomial $P$ of the form $$P(z) = \sum_{j=0}^{n}{a_jz^j}\,, \quad |a_0| = 1\,, \quad |a_j| \leq M\,, \quad a_j \in \Bbb{C}\,, \quad M \geq 1\,,$$ has at most…
Certificates of polynomial nonnegativity can be used to obtain tight dual bounds for polynomial optimization problems. We consider Sums of Nonnegative Circuit (SONC) polynomials certificates, which are well suited for sparse problems since…
A polynomial that is a sum of squares (SOS) of other polynomials is evidently positive. The converse is not true, there are positive polynomials which are not SOS. This note focuses on the problem of certifying, in exact arithmetic, that a…
The purpose of this paper consists to study the sums of the type $P(n) + P(n - d) + P(n - 2 d) + \dots$, where $P$ is a real polynomial, $d$ is a positive integer and the sum stops at the value of $P$ at the smallest natural number of the…
We study the root distribution of some univariate polynomials satisfying a recurrence of order two with linear and quadratic polynomial coefficients. We show that the set of non-isolated limits of zeros of the polynomials is the closure of…
We investigate structural properties of the completely positive semidefinite cone $\mathcal{CS}_+^n$, consisting of all the $n \times n$ symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. This…
The problem of optimizing over the cone of nonnegative polynomials is a fundamental problem in computational mathematics, with applications to polynomial optimization, control, machine learning, game theory, and combinatorics, among others.…