Computing gaussian \& exponential measures of semi-algebraic sets

Abstract

We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure μ() of (not necessarily compact) basic semi-algebraic sets⊂n. We obtain two monotone (non increasing and non decreasing) sequences of upper and lower bounds (ω\d), (ω\d), d∈, each converging to μ() as d∞. For each d, computing ω\d or ω\dreduces to solving a semidefinite program whose size increases with d. Some preliminary (small dimension) computational experiments are encouraging and illustrate thepotential of the method. The method also works for any measure whose moments are known and which satisfies Carleman's condition.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…