Minimum Volume Ellipsoid
M.V.E is a convex problem that given a set of points tries to find the smallest(minimal) ellipsoid that covers all of these points.
Getting Started
This is a very straight forward implementation using cvxpy and cvxpot in a anaconda envirenement.
Prerequisites
- Install anaconda
- Install CvxPy
conda install -c conda-forge lapack
conda install -c cvxgrp cvxpy
for more details please visit the CvxPy official Documentation This Code has two major parts:
-
M.V.E over all points
-
Minimum M.V.E over k points from N