Volume of quasi-homogeneous sublevel sets: Two linear algebra deterministic algorithms with convergence rates

Didier Henrion, Jean B Lasserre

Abstract

We consider the problem of computing the Lebesgue volume of the unit sublevel set of a positive quasi-homogeneous polynomial. Pushing the Lebesgue measure of an ambient bounding box forward through the polynomial reduces this high-dimensional volume to a one-dimensional moment problem. This removes the ambient dimension from the optimization and confines the dimension to a single preprocessing stage, computing the moments of the polynomial over the box, which is polynomial in the ambient dimension for sparse or separable polynomials. We propose two deterministic algorithms for the resulting univariate relaxations, each returning certified upper and lower bounds on the volume. Both bypass semidefinite optimization entirely and rely only on standard numerical linear algebra. The first approximates a piecewise-constant function by a Chebyshev polynomial, so that each relaxation reduces to a fast cosine transform, and converges at a polynomial rate in the relaxation order. The second extracts the volume bounds from a single generalized eigenvalue problem involving moment and localizing matrices whose size grows linearly with the relaxation order, and converges at an exponential rate; the ratio governing this rate is determined by an a priori upper bound on the polynomial over the bounding box. Finally, the univariate polynomials produced by either algorithm are feasible for the multivariate moment-SOS volume hierarchy. The algebraic and geometric rates therefore transfer to the hierarchy itself, improving on its best known convergence rates.

Disclosure

“ch. Making this precise, and estimating that critical value effectively, seems to us the natural continuation. Acknowledgments The authors are grateful to Matteo Tacchi-Bénard for useful exchanges. The authors acknowledge the use of AI (ChatGPT 5.6 and Claude Fable 5) for assistance with brainstorming ideas, mathematical development, coding and drafting the manuscript. The final content, analysis and conclusions remain the sole responsibility of the authors. References [1] F.”

PDF page 46
Classification
Drafting limited passages
Multiplier
5
Verified

Structural counts

Pages 47 pdf
Theorems 7 source
Lemmas 11 source
Propositions 10 source
Corollaries 5 source
Definitions 0 source
Displayed equations 150 source
Bibliography entries 30 source
Appendix pages 0 estimated

Count notes

  • Source counts use the expanded primary TeX file pushvol.tex.
  • Appendix pages include the first PDF page with an explicit Appendix heading through the final page.