Related papers: On the moment problem of closed semi-algebraic set…
We consider the problem of finding a (non-negative) measure $\mu$ on $\mathfrak{B}(\mathbb{C}^n)$ such that $\int_{\mathbb{C}^n} \mathbf{z}^{\mathbf{k}} d\mu(\mathbf{z}) = s_{\mathbf{k}}$, $\forall \mathbf{k}\in\mathcal{K}$. Here…
We consider the Moment-SOS hierarchy in polynomial optimization. We first provide a sufficient condition to solve the truncated K-moment problem associated with a given degree-$2n$ pseudo-moment sequence $\phi$ n and a semi-algebraic set $K…
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 H\"older continuity of the truncated moment map of a shade function in Euclidean space is established in the vicinity of a principal semi-algebraic set. The proof combines volume bounds of semi-algebraic sets and convex optimization…
We describe all solutions of the matrix Hamburger moment problem in a general case (no conditions besides solvability are assumed). We use the fundamental results of A.V. Shtraus on the generalized resolvents of symmetric operators. All…
The aim of this paper is to study the full $K-$moment problem for measures supported on some particular non-linear subsets $K$ of an infinite dimensional vector space. We focus on the case of random measures, that is $K$ is a subset of all…
The realizability problem is a well-known problem in the analysis of complex systems, which can be modeled as an infinite-dimensional moment problem. More precisely, as a truncated $K-$moment problem where $K$ is the space of all possible…
We prove a solvability theorem for the Stieltjes moment problem on $R^d$ which is based on the multivariate Stieltjes condition $\sum_{n=1}^\infty L(x_j^n)^{-1/(2n)}=+\infty$, $j=1,\dots,d.$ This result is applied to derive a new…
In this paper we obtain an algorithm towards solving the two-dimensional moment problem. This algorithm gives the necessary and sufficient conditions for the solvability of the moment problem. It is shown that all solutions of the moment…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
Suppose that $F$ is a free group and $k$ is a natural number. We show that the fully compressed membership problem for $k$-generated subgroups of $F$ is solvable in polynomial time. In order to do this, we adapt the theory of Stallings'…
Let $\mu$ be a given Borel measure on $\K\subseteq\R^n$ and let $y=(y_\alpha)$, $\alpha\in\N^n$, be a given sequence. We provide several conditions linking $y$ and the moment sequence $z=(z_\alpha)$ of $\mu$, for $y$ to be the moment…
A moment problem is presented for a class of signed measures which are termed pseudo-positive. Our main result says that for every pseudo-positive definite functional (subject to some reasonable restrictions) there exists a representing…
This paper deals with the moment problem on a (not necessarily finitely generated) commutative unital real algebra $A$. We define moment functionals on $A$ as linear functionals which can be written as integrals over characters of $A$ with…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
A subset of Q^n is called semilinear (or piecewise linear) if it is Boolean combination of linear half-spaces. We study the computational complexity of the constraint satisfaction problem (CSP) over the rationals when all the constraints…
In this paper, we investigate the computational complexity of the knapsack problem and subset sum problem for the following tropical algebraic structures. We consider the semigroup of square matrices of size $k \times k$ with non-negative…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
This paper proposes a real moment-HSOS hierarchy for complex polynomial optimization problems with real coefficients. We show that this hierarchy provides the same sequence of lower bounds as the complex analogue, yet is much cheaper to…