Related papers: Algebraic certificates for the truncated moment pr…
We assume that a finite set of moments of a random vector is given. Its underlying density is unknown. An algorithm is proposed for efficiently calculating Dirac mixture densities maintaining these moments while providing a homogeneous…
The trigonometric moment problem arises from the study of one-parameter families of centers in polynomial vector fields. It asks for the classification of the trigonometric polynomials $Q$ which are orthogonal to all powers of a…
Let $\mathbb{Q}$ (resp. $\mathbb{R}$) be the field of rational (resp. real) numbers and $X = (X_1, \ldots, X_n)$ be variables. Deciding the non-negativity of polynomials in $\mathbb{Q}[X]$ over $\mathbb{R}^n$ or over semi-algebraic domains…
We solve the truncated K-moment problem when $K\subseteq R^n$ is the closure of a, not necessarily bounded, open set (which includes the important cases $K=R^n$ and $K=R^n_+$). That is, we completely characterize the interior of the convex…
The generalized problem of moments is a conic linear optimization problem over the convex cone of positive Borel measures with given support. It has a large variety of applications, including global optimization of polynomials and rational…
The first part of this paper is devoted to an analysis of moment problems in R^n with supports contained in a closed set defined by finitely many polynomial inequalities. The second part of the paper uses the representation results of…
This paper studies Positivstellens\"atze and moment problems for sets $K$ that are given by universal quantifiers. Let $Q$ be a closed set and let $g = (g_1,...,g_s)$ be a tuple of polynomials in two vector variables $x$ and $y$. Then $K$…
The classical Truncated Moment problem asks for necessary and sufficient conditions so that a linear functional $L$ on $\mathcal{P}_{d}$, the vector space of real $n$-variable polynomials of degree at most $d$, can be written as integration…
We introduce a new strategy in solving the truncated complex moment problem. To this aim we investigate recursive doubly indexed sequences and their characteristic polynomials. A characterization of recursive doubly indexed \emph{moment}…
We present an expanded expository account of the $K$-moment problem for polynomial algebras over \(\R^d\), with special emphasis on compact basic closed semialgebraic sets. The central question is to characterize those linear functionals on…
In this paper we study the bivariate truncated moment problem (TMP) on curves of the form $y=q(x)$, $q(x)\in \mathbb{R}[x]$, $\text{deg } q\geq 3$, and $yx^\ell=1$, $\ell\in \mathbb{N}\setminus\{1\}$. For even degree sequences the solution…
We describe algebraic certificates of positivity for functions belonging to a finitely generated algebra of Borel measurable functions, with particular emphasis to algebras generated by semi-algebraic functions. In which case the standard…
In this paper, we combine the k-reduction map, the moment method, and the classical shadow method into a practical protocol for certifying the entanglement dimensionality. Our approach is based on the observation that a state with…
Let $G$ be a bounded open subset of Euclidean space with real algebraic boundary $\Gamma$. Under the assumption that the degree $d$ of $\Gamma$ is given, and the power moments of the Lebesgue measure on $G$ are known up to order $3d$, we…
The satisfiability problem in real closed fields is decidable. In the context of satisfiability modulo theories, the problem restricted to conjunctive sets of literals, that is, sets of polynomial constraints, is of particular importance.…
Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite…
We present a solution to the real multidimensional rational K-moment problem, where K is defined by finitely many polynomial inequalities. More precisely, let S be a finite set of real polynomials in X=(X_1,...,X_n) such that the…
In this paper we study the truncated operator trigonometric moment problem. All solutions of the moment problem are described by a Nevanlinna-type parameterization. In the case of moments acting in a separable Hilbert space, the matrices of…
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…
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…