On Numerical Solution of the Maximum Volume Ellipsoid Problem
From MaRDI portal
Recommendations
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- scientific article; zbMATH DE number 4114428
- Computation of Minimum-Volume Covering Ellipsoids
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- Recursive algorithms for inner ellipsoidal approximation of convex polytopes.
Cited in
(14)- Projective re-normalization for improving the behavior of a homogeneous conic linear system
- MVE
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Clustering via minimum volume ellipsoids
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- Improved Complexity for Maximum Volume Inscribed Ellipsoids
- Computing the maximum volume inscribed ellipsoid of a polytopic projection
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- Robust constrained control of piecewise affine systems through set‐based reachability computations
- Conditional minimum volume ellipsoid with application to multiclass discrimination
- Minimum-volume enclosing ellipsoids and core sets
- On KKT points of Celis-Dennis-Tapia subproblem
- Globally convergent evolution strategies for constrained optimization
- Optimal move blocking strategies for model predictive control
This page was built for publication: On Numerical Solution of the Maximum Volume Ellipsoid Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441948)
