The K-moment problem for continuous linear functionals
Jean Lasserre (LAAS)

TL;DR
This paper addresses the K-moment problem for continuous linear functionals on semi-algebraic sets, introducing a weighted norm approach to characterize nonnegative polynomials and provide explicit Positivstellensatz results.
Contribution
It introduces a weighted $ ext{l}_1$-norm framework to solve the K-moment problem for continuous linear functionals on non-compact semi-algebraic sets, with explicit projections and sparse supports.
Findings
Characterization of the $ ext{l}_w$-closure of preordering and quadratic module as the cone of polynomials nonnegative on K.
Solution of the K-moment problem for $ ext{l}_w$-continuous linear functionals.
Explicit form of a canonical $ ext{l}_w$-projection with sparse support.
Abstract
Given a closed (and non necessarily compact) basic semi-algebraic set , we solve the -moment problem for continuous linear functionals. Namely, we introduce a weighted -norm on , and show that the -closures of the preordering and quadratic module (associated with the generators of ) is the cone of polynomials nonnegative on . We also prove that an solve the -moment problem for -continuous linear functionals and completely characterize those -continuous linear functionals nonnegative on and (hence on ). When has a nonempty interior we also provide in explicit form a canonical -projection for any polynomial , on the (degree-truncated) preordering or quadratic module. Remarkably, the support of is very sparse and does not depend on ! This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Matrix Theory and Algorithms · Advanced Optimization Algorithms Research
