Related papers: Positively not SOS: pseudo-moments and extreme ray…
Our first contribution in this paper is to prove that three natural sum of squares (sos) based sufficient conditions for convexity of polynomials, via the definition of convexity, its first order characterization, and its second order…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…
The Sum-of-Squares (SOS) approximation method is a technique used in optimization problems to derive lower bounds on the optimal value of an objective function. By representing the objective function as a sum of squares in a feature space,…
The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a…
Some sum of squares (SOS) polynomials admit decomposition certificates, or positive semidefinite Gram matrices, with additional structure. In this work, we use the structure of Gram matrices to relate the representation theory of $SL(2)$ to…
In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Acad\'emie des Sciences-Series I-Mathematics, 328(6) (1999) pp.…
For a non-empty, finite subset $\mathcal{A} \subseteq \mathbb{N}_0^n$, denote by $C_{\text{sonc}}(\mathcal{A}) \in \mathbb{R}[x_1, \ldots, x_n]$ the cone of sums of non-negative circuit polynomials with support $\mathcal{A}$. We derive a…
This paper is devoted to the stability analysis of spatially interconnected systems (SISs) via the sum-of-squares (SOS) decomposition of positive trigonometric polynomials. For each spatial direction of SISs, three types of interconnected…
This paper proposes an efficient algorithm for testing copositivity of homogeneous polynomials over the positive semidefinite cone. The algorithm is based on a novel matrix optimization reformulation and requires solving a hierarchy of…
Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We…
We consider potentially non-convex optimization problems, for which optimal rates of approximation depend on the dimension of the parameter space and the smoothness of the function to be optimized. In this paper, we propose an algorithm…
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…
In polynomial optimization problems, nonnegativity constraints are typically handled using the sum of squares condition. This can be efficiently enforced using semidefinite programming formulations, or as more recently proposed by Papp and…
We study sum of squares (SOS) relaxations to optimize polynomial functions over a set $V\cap R^n$, where $V$ is a complex algebraic variety. We propose a new methodology that, rather than relying on some algebraic description, represents…
Let M be an archimedean quadratic module of real t-by-t matrix polynomials in n variables, and let S be the set of all real n-tuples where each element of M is positive semidefinite. Our key finding is a natural bijection between the set of…
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 consider three realization problems about monic real univariate polynomials without vanishing coefficients. Such a polynomial $P:=\sum_{j=0}^db_jx^j$ defines the sign pattern $\sigma (P):=({\rm sgn}(b_d)$, $\ldots$, ${\rm sgn}(b_0))$.…
Circuit polynomials are polynomials satisfying a number of conditions that make it easy to compute sharp and certifiable global lower bounds for them. Consequently, one may use them to find certifiable lower bounds for any polynomial by…
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…
We demonstrate applications of algebraic techniques that optimize and certify polynomial inequalities to problems of interest in the operations research and transportation engineering communities. Three problems are considered: (i) wireless…