Distance computation from an ellipsoid to a linear or a quadric surface in IRn
CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing
Alternative second-order cone programming formulations for support vector classification
Information Sciences: an International Journal
Hi-index | 0.00 |
We study the fundamental geometric problem of finding the distance between two ellipsoids. An algorithm is proposed for computing the distance and locating the two closest points. The algorithm is based on a local approximation of the two ellipsoids by balls. It is simple, geometric in nature, and has excellent convergence properties.