The A-truncated K-moment problem

Abstract

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 proposes a numerical algorithm for solving A-TKMPs. It is based on finding a flat extension of y by solving a hierarchy of semidefinite relaxations {(SDR)_k} for a moment optimization problem, whose objective R is generated in a certain randomized way. If y admits no K-measures and R[x]_A is K-full, then (SDR)_k is infeasible for all K big enough, which gives a certificate for the nonexistence of representing measures. If y admits a K-measure, then for almost all generated R, we prove that: i) we can asymptotically get a flat extension of y by solving the hierarchy {(SDR)_k\}; ii) under a general condition that is almost sufficient and necessary, we can get a flat extension of y by solving (SDR)_k for some k; this occurred in all our numerical experiments; iii) the obtained flat extensions admit a r-atomic K-measure with r <= |A|. The decomposition problems for completely positive matrices and sums of even powers of real linear forms, and the standard truncated K-moment problems, are special cases of A-TKMPs, and hence can be solved numerically by this algorithm.

29 pages

References in corpus (1)

• Truncated K-moment problems in several variables

Cited by in corpus (22)

• Sparse Noncommutative Polynomial Optimization
• Separability discrimination and decomposition of $m$-partite quantum mixed states
• The strong truncated Hamburger moment problem with and without gaps
• Estimation of multivariate generalized gamma convolutions through Laguerre expansions
• The truncated moment problem on the union of parallel lines
• The Truncated Moment Problem for Unital Commutative R-Algebras
• Linear Optimization with Cones of Moments and Nonnegative Polynomials
• Hermitian Tensor Decompositions
• Separability of Hermitian Tensors and PSD Decompositions
• Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
• Solving moment and polynomial optimization problems on Sobolev spaces
• A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors
• Estimating Mixture Models via Mixtures of Polynomials
• Stochastic Polynomial Optimization
• Completely Positive Binary Tensors
• T-optimal designs for multi-factor polynomial regression models via a semidefinite relaxation method
• Positive Maps and Separable Matrices
• Symmetric Tensor Nuclear Norms
• Distributionally Robust Optimization with Moment Ambiguity Sets
• Tensor Eigenvalue Complementarity Problems
• The CP-matrix Approximation Problem
• The Split Feasibility Problem with Polynomials