On the Distance between Two Ellipsoids

On the Distance between Two Ellipsoids

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 h...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on optimization 2002-01, Vol.13 (1), p.298-308
Hauptverfasser: Lin, Anhua, Han, Shih-Ping
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Linear programming
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1052-6234
1095-7189
DOI:10.1137/S1052623401396510