A note on approximation of a ball by polytopes

DOI10.1016/J.DISOPT.2004.07.003MaRDI QIDQ2386205zbMATH OpenOpenAlexFDO

Authors Martin Kochol

Publication date 22 August 2005

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2004.07.003

zbMATH Keywords

ApproximationPolytopeUnit ballVolumetric cutting plane algorithm

Mathematics Subject Classification ID

Approximation by convex sets (52A27) Approximation algorithms (68W25)

Recommendations

• Approximation of the Euclidean ball by polytopes with a restricted number of facets
• scientific article; zbMATH DE number 566419
• Approximation of the Euclidean ball by polytopes
• The surface area deviation of the Euclidean ball and a polytope
• Approximation of the Sphere by Polytopes having Few Vertices

Cites work

• A new algorithm for minimizing convex functions over convex sets
• Approximation of the Sphere by Polytopes having Few Vertices
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Computing the volume is difficult
• Convex Bodies with Few Faces
• Deterministic and randomized polynomial‐time approximation of radii
• Ellipsoidal approximations of convex sets based on the volumetric barrier
• Gelfand numbers of operators with values in a Hilbert space
• Geometric algorithms and combinatorial optimization
• How to compute the volume in high dimension?
• scientific article; zbMATH DE number 566419 (Why is no real title available?)
• scientific article; zbMATH DE number 665688 (Why is no real title available?)
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 863487 (Why is no real title available?)
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming

Cited in

(13)

• \((\delta ,\varepsilon)\)-ball approximation of a shape: definition and complexity
• Depth separations in neural networks: what is actually being separated?
• On the distance of polytopes with few vertices to the Euclidean ball
• Approximation of convex sets by polytopes
• Polytopal balls arising in optimization
• Approximation of the Sphere by Polytopes having Few Vertices
• scientific article; zbMATH DE number 566419 (Why is no real title available?)
• Explicit polyhedral approximation of the Euclidean ball
• Approximation of the Euclidean ball by polytopes with a restricted number of facets
• Approximation of the Euclidean ball by polytopes
• A simple proof of an estimate for the approximation of the Euclidean ball and the Delone triangulation numbers
• Polynomials with integral Mahler measures
• A method for uncertain linear optimization problems through polytopic approximation of the uncertainty set

This page was built for publication: A note on approximation of a ball by polytopes

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