Related papers: Sufficiently Regularized Nonnegative Quartic Polyn…
Let X be a real nondegenerate projective subvariety such that its set of real points is Zariski dense. We prove that every real quadratic form that is nonnegative on X is a sum of squares of linear forms if and only if X is a variety of…
We study the maximization of sums of heterogeneous quadratic forms over the Stiefel manifold, a nonconvex problem that arises in several modern signal processing and machine learning applications such as heteroscedastic probabilistic…
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…
Numerous interesting properties in nonlinear systems analysis can be written as polynomial optimization problems with nonconvex sum-of-squares problems. To solve those problems efficiently, we propose a sequential approach of local…
Given an $\mathcal{H}$-polytope $P$ and a $\mathcal{V}$-polytope $Q$, the decision problem whether $P$ is contained in $Q$ is co-NP-complete. This hardness remains if $P$ is restricted to be a standard cube and $Q$ is restricted to be the…
In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…
Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance…
In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…
Qubit regularization is a procedure to regularize the infinite dimensional local Hilbert space of bosonic fields to a finite dimensional one, which is a crucial step when trying to simulate lattice quantum field theories on a quantum…
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…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…
When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…
We develop new tools in the theory of nonlinear random matrices and apply them to study the performance of the Sum of Squares (SoS) hierarchy on average-case problems. The SoS hierarchy is a powerful optimization technique that has achieved…
We study sum-of-squares representations of symmetric univariate real matrix polynomials that are positive semidefinite along the real line. We give a new proof of the fact that every positive semidefinite univariate matrix polynomial of…
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 complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…
We use tropicalization to study the duals to cones of nonnegative polynomials and sums of squares on a semialgebraic set $S$. The truncated cones of moments of measures supported on the set $S$ is dual to nonnegative polynomials on $S$,…
The Moment/Sum-of-squares hierarchy provides a way to compute the global minimizers of polynomial optimization problems (POP), at the cost of solving a sequence of increasingly large semidefinite programs (SDPs). We consider large-scale…
The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of…