A note on approximation of a ball by polytopes

DOI10.1016/j.disopt.2004.07.003zbMath1085.52502OpenAlexW2091689278MaRDI QIDQ2386205

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 algorithms (68W25) Approximation by convex sets (52A27)

Related Items (2)

Approximation of convex sets by polytopes ⋮ Depth separations in neural networks: what is actually being separated?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• Computing the volume is difficult
• Gelfand numbers of operators with values in a Hilbert space
• Geometric algorithms and combinatorial optimization
• How to compute the volume in high dimension?
• A new algorithm for minimizing convex functions over convex sets
• Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
• Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier
• Convex Bodies with Few Faces
• Approximation of the Sphere by Polytopes having Few Vertices
• On Vaidya's Volumetric Cutting Plane Method for Convex Programming
• Deterministic and randomized polynomial‐time approximation of radii

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