Related papers: Non-extremal sextic moment problems
We find conditions which guarantee moment (in)determinacy of powers and products of nonnegative random variables. We establish new and general results which are based either on the rate of growth of the moments of a random variable or on…
When the algebraic variety associated with a truncated moment sequence is finite, solving the moment problem follows a well-defined procedure. However, moment problems involving infinite algebraic varieties are more complex and less…
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…
Finding relative pose between two calibrated images is a fundamental task in computer vision. Given five point correspondences, the classical five-point methods can be used to calculate the essential matrix efficiently. For the case of $N$…
We derive two-sided bounds for moments of random multilinear forms (random chaoses) with nonnegative coeficients generated by independent nonnegative random variables $X_i$ which satisfy the following condition on the growth of moments:…
Given real numbers $\beta \equiv \beta ^{\left( 4\right) }\colon \beta_{00}$, $\beta _{10}$, $\beta _{01}$, $\beta _{20}$, $\beta _{11}$, $ \beta _{02}$, $\beta _{30}$, $\beta _{21}$, $\beta _{12}$, $\beta _{03}$, $\beta _{40}$, $\beta…
We introduce the "moment rank" and "unitary rank" of numerical sequences, close relatives of linear-recursive order. We show that both parameters can be characterized by a broad set of criteria involving moments of measures, types of…
Recovering probability measures from moments is a central theme in statistics and optimization. In particular, we focus on the recovery of measures from moments and pseudo-moments, which may come from solving the moment-SOS hierarchy in one…
We will consider the indefinite truncated multidimensional moment problem. Necessary and sufficient conditions for a given truncated multisequence to have a signed representing measure $\mu$ with ${\rm card}\,{\rm supp}\, \mu$ as small as…
For the problems of low-rank matrix completion, the efficiency of the widely-used nuclear norm technique may be challenged under many circumstances, especially when certain basis coefficients are fixed, for example, the low-rank correlation…
In this paper, we develop a constructive solution for the pure truncated moment problem on cubic curves in Weierstrass form, establishing the existence of a representing measure whose number of atoms equals the rank of the associated moment…
In this paper, we discuss variational inequality (VI) problems without monotonicity from the perspective of convergence of projection-type algorithms. In particular, we identify existing conditions as well as present new conditions that are…
The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…
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 main result of the paper gives criteria for extendibility of sesquilinear form-valued mappings defined on symmetric subsets of *-semigroups to positive definite ones. By specifying this we obtain new solutions of: * the truncated…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
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…
Here, we give an algorithm for deciding if the nonnegative rank of a matrix $M$ of dimension $m \times n$ is at most $r$ which runs in time $(nm)^{O(r^2)}$. This is the first exact algorithm that runs in time singly-exponential in $r$. This…
A long series of previous papers have been devoted to the (one-dimensional) moment problem with nonnegative rational measure. The rationality assumption is a complexity constraint motivated by applications where a parameterization of the…
In this paper, we study the truncated matrix moment problem in one variable through recursive matrix extensions. \ We give necessary and sufficient conditions for a recursive matrix extension of finite data to be a matrix moment sequence in…