Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
From MaRDI portal
Recommendations
Cited in
(16)- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Linear time approximation of 3D convex polytopes
- An ellipsoid algorithm for the computation of fixed points
- For describing uncertainty, ellipsoids are better than generic polyhedra and probably better than boxes: a remark
- Approximate ellipsoid in the streaming model
- scientific article; zbMATH DE number 3843493 (Why is no real title available?)
- scientific article; zbMATH DE number 3908161 (Why is no real title available?)
- scientific article; zbMATH DE number 3929820 (Why is no real title available?)
- scientific article; zbMATH DE number 22873 (Why is no real title available?)
- scientific article; zbMATH DE number 568568 (Why is no real title available?)
- Goffin's algorithm for zonotopes
- scientific article; zbMATH DE number 6452509 (Why is no real title available?)
- A node elimination algorithm for cubature of high-dimensional polytopes
- Elliptic polytopes and invariant norms of linear operators
- Hausdorff approximation of 3D convex polytopes
This page was built for publication: Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939610)