The truncated moment problem via homogenization and flat extensions

DOI10.1016/j.jfa.2012.06.004zbMath1262.47018OpenAlexW2021129860MaRDI QIDQ452366

Lawrence A. Fialkow, Jia-Wang Nie

Publication date: 21 September 2012

Published in: Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfa.2012.06.004

zbMATH Keywords

semidefinite programminghomogenizationmomentflat extensiontruncated moment problemrepresenting measureRiesz functional

Mathematics Subject Classification ID

Linear operator methods in interpolation, moment and extension problems (47A57) Moment problems (44A60)

Related Items (24)

Local saddle points for unconstrained polynomial optimization ⋮ Separability of Hermitian tensors and PSD decompositions ⋮ Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Computing the distance between the linear matrix pencil and the completely positive cone ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ The saddle point problem of polynomials ⋮ On a minimal solution for the indefinite multidimensional truncated moment problem ⋮ Partially positive matrices ⋮ Interiors of completely positive cones ⋮ Hausdorff distance between convex semialgebraic sets ⋮ Generalized truncated moment problems with unbounded sets ⋮ Convex generalized Nash equilibrium problems and polynomial optimization ⋮ Symmetric Tensor Nuclear Norms ⋮ The \(\mathcal A\)-truncated \(K\)-moment problem ⋮ The core variety of a multisequence in the truncated moment problem ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ The CP-Matrix Approximation Problem ⋮ The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials ⋮ Monotonically positive matrices ⋮ Linear optimization with cones of moments and nonnegative polynomials ⋮ Limits of positive flat bivariate moment matrices ⋮ Semidefinite Representations of Noncompact Convex Sets ⋮ A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition

Uses Software

• SeDuMi

Cites Work

• An analogue of the Riesz-Haviland theorem for the truncated moment problem
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Positivity of Riesz functionals and solutions of quadratic and quartic moment problems
• Global Optimization with Polynomials and the Problem of Moments
• Lectures on Modern Convex Optimization
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
• Solution of the truncated complex moment problem for flat data
• On the closure of positive flat moment matrices
• Recursively determined representing measures for bivariate truncated moment sequences
• The proof of Tchakaloff’s Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The truncated moment problem via homogenization and flat extensions