scientific article; zbMATH DE number 4114428
From MaRDI portal
Publication:4729639
Recommendations
Cited in
(21)- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Construction of the ellipsoid of minimal volume for elementary polyhedrons
- For describing uncertainty, ellipsoids are better than generic polyhedra and probably better than boxes: a remark
- An algorithm for the parametric search of elliptic I- and S-hulls of a convex compactum
- scientific article; zbMATH DE number 4131965 (Why is no real title available?)
- Construction of thinnest digital ellipsoid using inverse projection and recursive integer intervals
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- Minimum-volume ellipsoidal approximation of the sum of two ellipsoids
- Elliptic polytopes and invariant norms of linear operators
- Finding the extreme ellipsoid contained in the sum of two ellipsoids
- Numerical solution of extremal problems on constructing ellipsoids and parallelepipeds
- Minimum-volume ellipsoids. Theory and algorithms
- Minimal ellipsoids and maximal simplexes in 3D Euclidean space
- scientific article; zbMATH DE number 4155779 (Why is no real title available?)
- An approximate method of ellipsoids
- Computing the maximum volume inscribed ellipsoid of a polytopic projection
- Determining ellipsoids by intersections with flats
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
- scientific article; zbMATH DE number 6027102 (Why is no real title available?)
- Rounding of Polytopes in the Real Number Model of Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729639)
