相关论文: The realizability problem as a special case of the…

It is known that positive definiteness is not enough for the multidimensional moment problem to be solved. We would like throw in to the garden of existing in this matter so far results one more, a result which takes into considerations the…

Let A be a finite subset of N^n, and K be a compact semialgebraic set in R^n. An A-tms is a vector y indexed by elements in A. The A-truncated K-moment problem (A-TKMP) studies whether a given A-tms y admits a K-measure or not. This paper…

This paper formally proposes a problem about the efficient utilization of the four dimensional space-time. Given a cuboid container, a finite number of rigid cuboid items, and the time length that each item should be continuous baked in the…

The truncated multidimensional moment problem is studied in terms of the Stieltjes transform as the interpolation problem. A step-by-step algorithm is constructed for the multidimensional moment problem and the set of solutions is found in…

The unbounded knapsack problem with bounded weights is a variant of the well-studied variant of the traditional binary knapsack problem; key changes being the relaxation of the binary constraint and allowing the unit weights of each item to…

This paper focuses on the resolution of infinite-dimensional Toeplitz Block LMIs, which are frequently encountered in the context of stability analysis and control design problems formulated in the harmonic framework. We propose a…

In a variety of applications it is important to extract information from a probability measure $\mu$ on an infinite dimensional space. Examples include the Bayesian approach to inverse problems and possibly conditioned) continuous time…

Reachability analysis is important for studying optimal control problems and differential games, which are powerful theoretical tools for analyzing and modeling many practical problems in robotics, aircraft control, among other application…

We study the approximation of high-dimensional rank one tensors using point evaluations and consider deterministic as well as randomized algorithms. We prove that for certain parameters (smoothness and norm of the $r$th derivative) this…

We convert, within polynomial-time and sequential processing, an NP-Complete Problem into a real-variable problem of minimizing a sum of Rational Linear Functions constrained by an Asymptotic-Linear-Program. The coefficients and constants…

We present a novel form of relativistic quantum mechanics and demonstrate how to solve it using a recently derived unitary perturbation theory, within partial wave analysis. The theory is tested on a relativistic problem, with two spinless,…

We consider the entanglement marginal problem, which consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. To tackle this problem, we propose hierarchies of semidefinite…

Let $K_f$ be a closed semi-algebraic set in $\dR^d$ such that there exist bounded real polynomials $h_1,{...},h_n$ on $K_f$. It is proved that the moment problem for $K_f$ is solvable provided it is for all sets $K_f\cap C_\lambda$, where…

We find necessary and sufficient conditions for the existence of a probability measure on $\mathbb{N}_0$, the nonnegative integers, whose first $n$ moments are a given $n$-tuple of nonnegative real numbers. The results, based on finding an…

We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint matrix entries from given interval domains there are…

This paper deals with the problem of point-to-point reachability in multi-linear systems. These systems consist of a partition of the Euclidean space into a finite number of regions and a constant derivative assigned to each region in the…

In this article we study the bivariate truncated moment problem (TMP) of degree $2k$ on the union of parallel lines. First we present an alternative proof of Fialkow's solution \cite{Fia15} to the TMP on the union of two parallel lines…

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.…

This paper is about the moment problem on a finite-dimensional vector space of continuous functions. We investigate the structure of the convex cone of moment functionals (supporting hyperplanes, exposed faces, inner points) and treat…

Given a closed subset $K$ in $\mathbb{R}$, the rational $K$-truncated moment problem ($K$-RTMP) asks to characterize the existence of a positive Borel measure $\mu$, supported on $K$, such that a linear functional $\mathcal{L}$, defined on…