The initial convergence rate of adaptive methods for polyhedral approximation of convex bodies
From MaRDI portal
Publication:3545174
DOI10.1134/S0965542508050035;zbMATH Open1164.90424MaRDI QIDQ3545174FDOQ3545174
Authors: G. K. Kamenev
Publication date: 9 December 2008
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Cited In (11)
- Adaptive, anisotropic and hierarchical cones of discrete convex functions
- On asphericity of convex bodies
- Title not available (Why is that?)
- 10.1007/s11470-008-3005-z
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Systematization of problems on ball estimates of a convex compactum
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Method for finding an approximate solution of the asphericity problem for a convex body
- Optimal adaptive methods for the polyhedral approximation of convex bodies
- Triangulating smooth submanifolds with light scaffolding
- Spherical shell of the boundary of a compact set with a minimum cross-sectional area formed by a two-dimensional plane
This page was built for publication: The initial convergence rate of adaptive methods for polyhedral approximation of convex bodies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545174)