Related papers: Algebraic certificates for the truncated moment pr…
Motivated by recent results in random matrix theory we will study the distributions arising from products of complex Gaussian random matrices and truncations of Haar distributed unitary matrices. We introduce an appropriately general class…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…
Many real life problems can be reduced to the solution of a complex exponentials approximation problem which is usually ill posed. Recently a new transform for solving this problem, formulated as a specific moments problem in the plane, has…
Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic…
This paper is a continuation of our previous investigation on the truncated matrix trigonometric moment problem in Ukrainian Math. J., 2011, 63, no.6, 786-797. In the present paper we obtain a Nevanlinna-type formula for this moment problem…
Given two real vector spaces $U$ and $V$, and a symmetric bilinear map $B: U\times U\to V$, let $Q_B$ be its associated quadratic map $Q_B$. The problems we consider are as follows: (i) are there necessary and sufficient conditions,…
We build a class of polynomial problems with not polynomial certificates. The parameter concerning which are defined efficiency of corresponding algorithms is the number $n$ of elements of the set has used at construction of combinatory…
In a first contribution, we revisit two certificates of positivity on (possibly non-compact) basic semialgebraic sets due to Putinar and Vasilescu [Comptes Rendus de l'Acad\'emie des Sciences-Series I-Mathematics, 328(6) (1999) pp.…
These are ten lectures on the moment problem delivered by the author at the Vietnam Institute of Advanced Studies in Mathematics, Hanoi, March 2019. The first 3 lectures are about the one-dimensional full and truncated moment problem. The…
We study a truncated two-dimensional moment problem in terms of the Stieltjes transform. The set of the solutions is described by the Schur step-by-step algorithm, which is based on the continued fraction expansion of the solution. In…
One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums…
We study truncated moment sequences of distribution mixtures, especially from Gaussian and log-normal distributions and their Carath\'eodory numbers. For $\mathsf{A} = \{a_1,\dots,a_m\}$ continuous (sufficiently differentiable) functions on…
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…
In this prelinimary version of paper, we propose to give a complete solution to the Truncated Multidimensional Trigonometric Moment Problem (TMTMP) from a system and signal processing perspective. In mathematical TMTMPs, people care about…
Several signal recovery tasks can be relaxed into semidefinite programs with rank-one minimizers. A common technique for proving these programs succeed is to construct a dual certificate. Unfortunately, dual certificates may not exist under…
Certificates of non-negativity such as Putinar's Positivstellensatz have been used to obtain powerful numerical techniques to solve polynomial optimization (PO) problems. Putinar's certificate uses sum-of-squares (sos) polynomials to…
We consider the problem of minimizing a polynomial $f$ over the binary hypercube. We show that, for a specific set of polynomials, their binary non-negativity can be checked in a polynomial time via minimum cut algorithms, and we construct…