Answers are grounded in this paper and cite their sources.
Given a basic compact semialgebraic set Kⁿ, we introduce a methodology that generates a sequence converging to the volume of K. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear programs. Not only the volume but also every finite vector of moments of the probability measure that is uniformly distributed on K can be approximated as closely as desired, which permits the approximation of the integral on K of any given polynomial; the extension to integration against some weight functions is also provided. Finally, some numerical issues associated with the algorithms involved are briefly discussed.
No takes yet. Share an insight, caveat, or question.
Henrion et al. (2009) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: