Samenvatting
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degree of a variety is the number of critical points of the squared distance to a generic point outside the variety. Focusing on varieties seen in applications, we present numerous tools for computation.
Keywords: Nearest point map, Euclidean distance, polynomial optimization, computing critical points, dual variety, Chern class
| Originele taal-2 | Engels |
|---|---|
| Titel | 2014 Symposium on Symbolic-Numeric Computation (SNC'14, Shanghai, China, July 28-31, 2014) |
| Redacteuren | L. Zhi, M. Watt |
| Plaats van productie | New York |
| Uitgeverij | Association for Computing Machinery, Inc. |
| Pagina's | 9-16 |
| ISBN van geprinte versie | 978-1-4503-2963-7 |
| DOI's | |
| Status | Gepubliceerd - 2014 |
| Evenement | conference; 2014 Symposium on Symbolic-Numeric Computation; 2014-07-28; 2014-07-31 - Duur: 28 jul. 2014 → 31 jul. 2014 |
Congres
| Congres | conference; 2014 Symposium on Symbolic-Numeric Computation; 2014-07-28; 2014-07-31 |
|---|---|
| Periode | 28/07/14 → 31/07/14 |
| Ander | 2014 Symposium on Symbolic-Numeric Computation |
Vingerafdruk
Duik in de onderzoeksthema's van 'The Euclidean distance degree'. Samen vormen ze een unieke vingerafdruk.Citeer dit
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver