The modified method of refined bounds for polyhedral approximation of convex polytopes

DOI10.1134/S0965542508060055zbMath1164.90425OpenAlexW2163562248MaRDI QIDQ3545189

A. I. Pospelov, Alexander 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

zbMATH Keywords

iterationconvergence ratepolyhedral approximationconvex polytopesconvex polyhedra

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

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 ⋮ Approximating a solution set of nonlinear inequalities ⋮ Approximation of convex bodies by multiple objective optimization and an application in reachable sets ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

This page was built for publication: The modified method of refined bounds for polyhedral approximation of convex polytopes