SFU Operations Research Seminar: Isabelle Shankar
Topic
Central Curve in Semidefinite Programming
Speakers
Details
The Zariski closure of the central path (which interior point algorithms track in convex optimization problems such as linear and semidefinite programs) is an algebraic curve, called the central curve. Its degree has been studied in relation to the complexity of these interior point algorithms. We show that the degree of the central curve for generic semidefinite programs is equal to the maximum likelihood degree of linear concentration models. This is joint work with Serkan Hosten and Angélica Torres.
Additional Information
Location: ASB 10908
Time: 3.30pm Pacific
Isabelle Shankar, Portland State University
This is a Past Event
Event Type
Scientific, Seminar
Date
April 13, 2023
Time
-
Location