# Problem

Let be the points in . Given these points we need to find an ellipsoid, that contains all points with the minimum volume (in 2d case volume of an ellipsoin is just the square).

An invertible linear transformation applied to a unit sphere produces an ellipsoid with the square, that is times bigger, than the unit sphere square, that’s why we parametrize the interior of ellipsoid in the following way:

Sadly, the determinant is the function, which is relatively hard to minimize explicitly. However, the function is actually convex, which provides a great opportunity to work with it. As soon as we need to cover all the points with ellipsoid of minimum volume, we pose an optimization problem on the convex function with convex restrictions:

# Code

# References

- Jupyter notebook by A. Katrutsa
- https://cvxopt.org/examples/book/ellipsoids.html