Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
From MaRDI portal
Publication:327054
DOI10.1134/S0965542516050080zbMATH Open1356.65037MaRDI QIDQ327054FDOQ327054
Authors: G. K. Kamenev
Publication date: 13 October 2016
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
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
numerical examplesconvergence rateconvex bodiesestimate refinement methodpolyhedral approximationestimate of algorithmsfacial structuremultidimensional balloptimal method
Cites Work
- Title not available (Why is that?)
- Analysis of an algorithm for approximating convex bodies
- Interactive decision maps. Approximation and visualization of Pareto frontier
- The initial convergence rate of adaptive methods for polyhedral approximation of convex bodies
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polytopal approximation bounding the number of \(k\)-faces
- Construction of suboptimal coverings of the multidimensional unit sphere
- Numerical analysis of the efficiency of an algorithm for approximating convex bodies by polyhedra
- The upper bound theorem for polytopes: An easy proof of its asymptotic version
- Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
- Iterative method for constructing coverings of the multidimensional unit sphere
- Optimal growth order of the number of vertices and facets in the class of Hausdorff methods for polyhedral approximation of convex bodies
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Title not available (Why is that?)
- Optimal adaptive methods for the polyhedral approximation of convex bodies
- Methods and algorithms for analyzing linear systems, by constructing generalized sets of attainability
- Title not available (Why is that?)
- Efficient algorithms for approximation of nonsmooth convex bodies
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
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
- Determining solution set of nonlinear inequalities using space-filling curves for finding working spaces of planar robots
- Finding sets of solutions to systems of nonlinear inequalities
- Title not available (Why is that?)
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)