Volume of sublevel sets of homogeneous polynomials

DOI10.1137/18M1222478MaRDI QIDQ5234531zbMATH OpenWikidataFDO

Authors Jean B. Lasserre

Publication date 27 September 2019

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1810.10224

zbMATH Keywords

computational geometrygeneralized eigenvaluesemi-algebraic setssemidefinite programmingvolume computation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical integration (65D30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical mathematical programming methods (65K05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22)

Abstract: Consider the sub level set K := {x : g(x) $le$ 1} where g is a positive and homogeneous polynomial. We show that its Lebesgue volume can be approximated as closely as desired by solving a sequence of generalized eigenvalue problems with respect to a pair of Hankel matrices of increasing size, and whose entries are obtained in closed form.

Recommendations

• Level Sets and NonGaussian Integrals of Positively Homogeneous Functions
• Volume estimates of sublevel sets of real polynomials
• Approximate volume and integration for basic semialgebraic sets
• On the minimal number of moments required to recover the sublevel set of a homogeneous polynomial
• Recovering an homogeneous polynomial from moments of its level set

Cites work

• A generalization of Löwner-John's ellipsoid theorem
• Approximate volume and integration for basic semialgebraic sets
• Computing Gaussian \& exponential measures of semi-algebraic sets
• scientific article; zbMATH DE number 3136785 (Why is no real title available?)
• scientific article; zbMATH DE number 914800 (Why is no real title available?)
• Introduction to nonlinear algebra
• Introduction to semidefinite, conic and polynomial optimization
• Level Sets and NonGaussian Integrals of Positively Homogeneous Functions
• Moments, positive polynomials and their applications
• Orthogonal polynomials of several variables
• Semidefinite approximations of projections and polynomial images of semialgebraic sets

Cited in

(9)

• On the minimal number of moments required to recover the sublevel set of a homogeneous polynomial
• Nonnegative forms with sublevel sets of minimal volume
• A converse sum of squares Lyapunov function for outer approximation of minimal attractor sets of nonlinear systems
• Measuring the level sets of generalized homogeneous functions
• Volume estimates of sublevel sets of real polynomials
• Computing the Hausdorff boundary measure of semialgebraic sets
• Minimizing rational functions: a hierarchy of approximations via pushforward measures
• Volumes of Sublevel Sets of Nonnegative Forms and Complete Monotonicity
• An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials

Describes a project that uses

Uses Software

• ParetoImageSDP

This page was built for publication: Volume of sublevel sets of homogeneous polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5234531)