Return to Colloquia & Seminar listing
The Algebraic Degree of Semidefinite Programming
ColloquiumSpeaker: | Bernd Sturmfels, University of California, Berkeley |
Location: | 2112 MSB |
Start time: | Tue, Jun 5 2007, 3:10PM |
This lecture discusses recent interactions between convex optimization and algebraic geometry. Given a semidefinite programming problem which is specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically, this degree counts the critical points attained by a linear functional on a rank variety of fixed rank in a linear space of symmetric matrices.
Note the UNUSUAL TIME and LOCATION (2112).
Refreshments will start at 2:50 in MSB 2212 (Alder Room). Dinner will follow the Colloquium.