A class of adaptive algorithms for approximating convex bodies by polyhedra
From MaRDI portal
(Redirected from Publication:1189787)
See the review in Zbl 0756.52006.
Cited in
(14)- Properties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problems
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
- Convergence of Hausdorff approximation methods for the Edgeworth-Pareto hull of a compact set
- Adaptive quadrature/cubature rule: application to polytopes
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- scientific article; zbMATH DE number 4216876 (Why is no real title available?)
- 10.1007/s11470-008-3005-z
- Optimality of the methods for approximating the feasible criterion set in the convex case
- scientific article; zbMATH DE number 1320218 (Why is no real title available?)
- Algorithm design and approximation analysis on distributed robust game
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Approximations of unbounded convex projections and unbounded convex sets
- On parallel and batch-cutting strategies for norm-minimization-based convex vector optimization
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
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)
