Improved Complexity for Maximum Volume Inscribed Ellipsoids
From MaRDI portal
Recommendations
Cited in
(15)- Inscribed and circumscribed ellipsoidal cones: volume ratio analysis
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
- Duality of ellipsoidal approximations via semi-infinite programming
- Minimum-volume enclosing ellipsoids and core sets
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Algorithms to construct a minimum-volume invariant ellipsoid for a stable dynamic system
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Ellipsoidal approximations of convex sets based on the volumetric barrier
- Maximum Volume Inscribed Ellipsoid: A New Simplex-Structured Matrix Factorization Framework via Facet Enumeration and Convex Optimization
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Computing the maximum volume inscribed ellipsoid of a polytopic projection
- Accuracy certificates for convex minimization with inexact oracle
- A modification of the inscribed ellipsoid method
- scientific article; zbMATH DE number 926786 (Why is no real title available?)
This page was built for publication: Improved Complexity for Maximum Volume Inscribed Ellipsoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785883)
