English

Duality attainment and strict feasibility of the generalized moment problem and its relaxations

Optimization and Control 2026-04-17 v1

Abstract

The generalized moment problem (GMP) is an infinite dimensional linear problem over the cone of finite nonnegative Borel measures. When a GMP instance involves finitely many polynomial moment constraints, moment/sum-of-squares hierarchies provide a sequence of bounds converging to the optimal value. We consider GMP instances with measures supported over a compact basic semialgebraic set XX. We study the case when XX has nonempty interior, and the case when XX is the vanishing set of prescribed polynomials forming a Gr\"obner basis of the ideal they generate, which we assume is real radical. Under a relative interior assumption, we show attainment of the infinite dimensional dual problem, and attainment of each associated finite dimensional sum-of-squares strengthening. For the latter we present two disjoint proofs. The first is obtained by adapting results regarding the closedness of quadratic modules, and the second builds on Csisz\'ar's work on exponential density constructions to find a strictly feasible measure. Finally, we discuss the special case where XX is the product of spheres, and applications of our results to GMP instances arising from tensor optimization and quantum information theory.

Cite

@article{arxiv.2604.15072,
  title  = {Duality attainment and strict feasibility of the generalized moment problem and its relaxations},
  author = {Sami Halaseh and Victor Magron and Mateusz Skomra},
  journal= {arXiv preprint arXiv:2604.15072},
  year   = {2026}
}

Comments

48 pages