Related papers: The Moment Problem for Continuous Positive Semidef…
The moment-SOS (sum of squares) hierarchy is a powerful approach for solving globally non-convex polynomial optimization problems (POPs) at the price of solving a family of convex semidefinite optimization problems (called moment-SOS…
The Moment-SOS hierarchy initially introduced in optimization in 2000, is based on the theory of the K-moment problem and its dual counterpart, polynomials that are positive on K. It turns out that this methodology can be also applied to…
We extend Haviland's theorem on the integral representation of positive linear functionals on usual (real multivariate) polynomials to the integral representation of positive linear maps on operator polynomials mapping into the space of…
Consider the closed convex hull $K$ of a monomial curve given parametrically as $(t^{m_1},\ldots,t^{m_n})$, with the parameter $t$ varying in an interval $I$. We show, using constructive arguments, that $K$ admits a lifted semidefinite…
Let $A$ be a vector space of real valued functions on a non-empty set $X$ and $L:A\rightarrow\mathbb{R}$ a linear functional. Given a $\sigma$-algebra $\mathcal{A}$, of subsets of $X$, we present a necessary condition for $L$ to be…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…
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…
Let $R$ be a unitary commutative real algebra and $K\subseteq Hom(R,\mathbb{R})$, closed with respect to the product topology. We consider $R$ endowed with the topology $\mathcal{T}_K$, induced by the family of seminorms…
The standard moment-sum-of-squares (SOS) hierarchy is a powerful method for solving global polynomial optimization problems. However, its convergence relies on Putinar's Positivstellensatz, which requires the feasible set to satisfy the…
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…
We study a class of polynomial optimization problems with a robust polynomial matrix inequality (PMI) constraint where the uncertainty set itself is defined also by a PMI. These can be viewed as matrix generalizations of semi-infinite…
We investigate the problem of representing moment sequences by measures in the context ofPolynomial Optimization Problems, that consist in finding the infimum of a real polynomial ona real semialgebraic set defined by polynomial…
This paper studies the copositive optimization problem whose objective is a sparse polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS relaxations to solve it. Necessary and sufficient conditions…
This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…
We study continuous quadratic submodular minimization with bounds and propose a polynomially sized semidefinite relaxation, which is provably tight for dimension $n \le 3$ and empirically tight for larger $n$. We apply the relaxation to two…
The uniform probability measure on a convex polytope induces piecewise polynomial densities on its projections. For a fixed combinatorial type of simplicial polytopes, the moments of these measures are rational functions in the vertex…
A topological semigroup is monothetic provided it contains a dense cyclic subsemigroup. The Koch problem asks whether every locally compact monothetic monoid is compact. This problem was opened for more than sixty years, till in 2018…
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 truncated moment problem consists of determining whether a given finitedimensional vector of real numbers y is obtained by integrating a basis of the vector space of polynomials of bounded degree with respect to a non-negative measure…