The Euclidean Distance Degree

The Euclidean Distance Degree

-
Bernd Sturmfels, U.C. Berkeley
Sherrerd Hall 101

The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. The Euclidean distance degree is the number of critical points for this optimization problem. We focus on varieties seen in engineering applications, and we discuss tools for exact computation. Our guiding example is the Eckart-Young Theorem which relates the nearest point map for low rank matrices with the singular value decomposition. This is joint work with Jan Draisma, Emil Horobet, Giorgio Ottaviani, Rekha Thomas. [Preprint: http://front.math.ucdavis.edu/1309.0049 ]