The modified method of refined bounds for polyhedral approximation of convex polytopes
From MaRDI portal
Publication:3545189
DOI10.1134/S0965542508060055zbMATH Open1164.90425OpenAlexW2163562248MaRDI QIDQ3545189FDOQ3545189
Authors: A. I. Pospelov, A. V. Lotov
Publication date: 9 December 2008
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542508060055
Recommendations
- scientific article; zbMATH DE number 2210590
- Analysis of a new method for approximation of convex compact bodies by polyhedra
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Optimal adaptive methods for the polyhedral approximation of convex bodies
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (7)
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Approximating a solution set of nonlinear inequalities
- 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
- Title not available (Why is that?)
- Finding sets of solutions to systems of nonlinear inequalities
This page was built for publication: The modified method of refined bounds for polyhedral approximation of convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545189)