Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies
From MaRDI portal
Publication:2898130
DOI10.1134/S0965542511060054zbMath1249.90330MaRDI QIDQ2898130
Georgy K. Kamenev, Roman V. Efremov
Publication date: 16 July 2012
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (5)
Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls ⋮ Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality ⋮ Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls ⋮ Construction of suboptimal coverings of the multidimensional unit sphere ⋮ Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
This page was built for publication: Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies