On volumes of bounded convex sets

DOI10.1080/02331930903500340MaRDI QIDQ3553758zbMATH OpenOpenAlexFDO

Authors R. Elster

Publication date 21 April 2010

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930903500340

zbMATH Keywords

volumeSteiner symmetrizationminimal width

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Recommendations

• Publication:4723577
• Global optimization on convex sets
• Computing the volume is difficult
• A class of algorithms for computing the minimal value of a convex functionfover[0 1]^kwithin accuracy ∊, when the evaluations offare made within accuracy ∊
• Minimization methods for functions on simple sets

Cited in

(10)

• On volume product inequalities for convex sets
• On the volume of equichordal sets.
• Hull-volume with applications to convergence analysis
• On the volume bound in the Dvoretzky-Rogers lemma
• On the volume set of boxes in finite spaces
• An Introduction to the Volume Conjecture
• Centers and partial volumes of convex cones. I: Basic theory
• On the volume of sets having constant width
• On the volume of sets bounded by refinable functions
• scientific article; zbMATH DE number 5173422 (Why is no real title available?)

This page was built for publication: On volumes of bounded convex sets

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