An algorithm for constructing of minimal volume ellipsoid
From MaRDI portal
The author proposes a new algorithm for constructing the minimal volume ellipsoid which contains the given finite set of points in \(R^{m}\). This algorithm is based on the constructing of a minimal volume ellipsoid for elementary polygons. Here the elementary polygon in \(R^{m}\) is a convex polygon containing from \((m+1)\) to \({1\over 2}m(m+3)+1\) vertices.
Recommendations
- Minimum-volume ellipsoids. Theory and algorithms
- Computing minimum-volume enclosing ellipsoids
- Computing minimum-volume enclosing axis-aligned ellipsoids
- Computation of Minimum-Volume Covering Ellipsoids
- Construction of the ellipsoid of minimal volume for elementary polyhedrons
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system
Cited in
(21)- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities
- Various modifications of optimum algorithm of construction of the minimal area ellipse
- Construction of the ellipsoid of minimal volume for elementary polyhedrons
- A linearly convergent algorithm for solving the minimum volume axis-aligned ellipsoid problem
- A Filtering Heuristic for the Computation of Minimum-Volume Enclosing Ellipsoids
- An algorithm for the parametric search of elliptic I- and S-hulls of a convex compactum
- Modification of the Fëdorov-Wynn computing method in connection with the determination of the elliptic hull of a given system of vectors
- On the algorithm of Petunin confidence ellipsoid construction
- scientific article; zbMATH DE number 22873 (Why is no real title available?)
- scientific article; zbMATH DE number 617844 (Why is no real title available?)
- Grid and cloud computing for the modeling of the motion of a magnetized assymmetric body in an external magnetic field
- scientific article; zbMATH DE number 2169260 (Why is no real title available?)
- scientific article; zbMATH DE number 221630 (Why is no real title available?)
- On the regularity of the growth of the modulus and argument of an entire function in the metric of L p [0, 2π]
- Minimum-Area ellipse containing a finite set of points. II
- scientific article; zbMATH DE number 1902046 (Why is no real title available?)
- Construction of thinnest digital ellipsoid using inverse projection and recursive integer intervals
- Minimal ellipsoids and maximal simplexes in 3D Euclidean space
- Minimum Ellipsoids
- Computing minimum-volume enclosing ellipsoids
- The MDM algorithm and the Sylvester problem
This page was built for publication: An algorithm for constructing of minimal volume ellipsoid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2739958)
