A class of adaptive algorithms for approximating convex bodies by polyhedra
From MaRDI portal
Publication:1189787
zbMATH Open0788.52004MaRDI QIDQ1189787FDOQ1189787
Authors: G. K. Kamenev 
Publication date: 27 September 1992
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Cited In (12)
- Convergence of Hausdorff approximation methods for the Edgeworth-Pareto hull of a compact set
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Title not available (Why is that?)
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Title not available (Why is that?)
- 10.1007/s11470-008-3005-z
- Algorithm design and approximation analysis on distributed robust game
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Adaptive quadrature/cubature rule: application to polytopes
- Optimality of the methods for approximating the feasible criterion set in the convex case
- Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
This page was built for publication: A class of adaptive algorithms for approximating convex bodies by polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189787)
