The Effective Countable Generalized Moment Problem
Date:
This talk presented recent convergence rates for the moment-SOS relaxations Generalized Moment Problem (GMP). Under Archimedean, S-fullness, and dual attainment conditions, one derives geometry-adaptive bounds for GMPs with countable moment constraints. The results ensure convergence of optimal values, feasibility sets in Hausdorff distance, and optimizers in the weak* topology. Applications of these relaxations to symmetric tensor decomposition were presented.