Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
From MaRDI portal
Recommendations
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Optimal adaptive methods for the polyhedral approximation of convex bodies
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Complexity of methods for approximating convex compact bodies by double description polytopes and complexity bounds for a hyperball
- scientific article; zbMATH DE number 2124548
Cites work
- scientific article; zbMATH DE number 4212902 (Why is no real title available?)
- scientific article; zbMATH DE number 192896 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 480235 (Why is no real title available?)
- scientific article; zbMATH DE number 1105179 (Why is no real title available?)
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- scientific article; zbMATH DE number 2124548 (Why is no real title available?)
- scientific article; zbMATH DE number 3282420 (Why is no real title available?)
- scientific article; zbMATH DE number 3286350 (Why is no real title available?)
- Analysis of an algorithm for approximating convex bodies
- Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Construction of suboptimal coverings of the multidimensional unit sphere
- Efficient algorithms for approximation of nonsmooth convex bodies
- Interactive decision maps. Approximation and visualization of Pareto frontier
- Iterative method for constructing coverings of the multidimensional unit sphere
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- Optimal adaptive methods for the polyhedral approximation of convex bodies
- Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies
- Polytopal approximation bounding the number of \(k\)-faces
- The initial convergence rate of adaptive methods for polyhedral approximation of convex bodies
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
Cited in
(9)- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- The modified method of refined bounds for polyhedral approximation of convex polytopes
- Approximating a solution set of nonlinear inequalities
- 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
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Finding sets of solutions to systems of nonlinear inequalities
- Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
- scientific article; zbMATH DE number 5568532 (Why is no real title available?)
This page was built for publication: Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327054)
