Related papers: The A-truncated K-moment problem
This paper is about the general truncated matrix-valued moment problem. Let $\mathcal{H}_q$ denote the complex Hermitian $q\times q$-matrices, $q\in \mathbb{N}$. Suppose that $(\mathcal{X},\mathfrak{X})$ is a measurable space and…
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…
Let $\gamma^{(m)} \equiv \{ \gamma_{ij} \}_{0 \leq i +j \leq m}$ be a given complex-valued sequence. The truncated complex moment problem (TCMP in short) involves determining necessary and sufficient conditions for the existence of a…
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…
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 tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…
The (classical) truncated moment problem, extensively studied by Curto and Fialkow, asks to characterize when a finite sequence of real numbers indexes by words in commuting variables can be represented with moments of a positive Borel…
We study the truncated two-dimensional moment problem (with rectangular data): to find a non-negative measure $\mu(\delta)$, $\delta\in\mathfrak{B}(\mathbb{R}^2)$, such that $\int_{\mathbb{R}^2} x_1^m x_2^n d\mu = s_{m,n}$, $0\leq m\leq…
Clustering is a hard discrete optimization problem. Nonconvex approaches such as low-rank semidefinite programming (SDP) have recently demonstrated promising statistical and local algorithmic guarantees for cluster recovery. Due to the…
We show how to approximate a data matrix $\mathbf{A}$ with a much smaller sketch $\mathbf{\tilde A}$ that can be used to solve a general class of constrained k-rank approximation problems to within $(1+\epsilon)$ error. Importantly, this…
$K$-means clustering is a widely used machine learning method for identifying patterns in large datasets. Recently, semidefinite programming (SDP) relaxations have been proposed for solving the $K$-means optimization problem, which enjoy…
We obtain a new multiplicative decomposition of the resolvent matrix of the truncated Hausdorff matrix moment (THMM) problem in the case of an odd and even number of moments via new Dyukarev-Stieltjes matrix (DSM) parameters. Explicit…
In this article we study the bivariate truncated moment problem (TMP) of degree $2k$ on reducible cubic curves. First we show that every such TMP is equivalent after applying an affine linear transformation to one of 8 canonical forms of…
In this paper we provide necessary and sufficient (KKT) conditions for global optimality for a new class of possibly nonconvex quadratically constrained quadratic programming (QCQP) problems, denoted by S-QCQP. The class consists of QCQP…
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…
We study an optimization problem in which the objective is given as a sum of logarithmic-polynomial functions. This formulation is motivated by statistical estimation principles such as maximum likelihood estimation, and by loss functions…
In this paper we study the truncated power moment problem with an odd number of prescribed moments. A Nevanlinna-type formula is derived for this moment problem in the case when the moment problem has more than one solution (the…
The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive…
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…
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…