CORE Series

**December 2, 2014, 4:00pm**

*EE 125*

**Peter Bürgisser,** *Institute for Mathematics, TU Berlin.*

**Condition of Convex Optimization and Spherical Intrinsic Volumes**

Abstract: The analysis of the stability and efficiency of algorithms for convex optimization naturally leads to the study of condition numbers. The Grassmann condition, which is a geometric version of Renegar’s condition, is especially suited for a probabilistic analysis. Such analysis can be performed by relying on techniques from spherical convex geometry and differential geometry. Along this way, we obtain an average analysis of the Grassmann condition number that holds for any regular convex cone. A closer look prompts the investigation of the spherical counterparts of intrinsic volumes — a notion thoroughly studied for euclidean spaces, but much less so for spheres, so that many fascinating questions remain.

Joint work with Dennis Amelunxen.

Bio: Peter Bürgisser has been a professor of Mathematics at the Technical University of Berlin since 2013. Prior to that he was a professor of Mathematics at the University of Paderborn. His research interests are algebraic complexity theory, symbolic and numeric computation, and more recently, the probabilistic analysis of numerical algorithms. Bürgisser was an invited speaker at the International Congress of Mathematicians in Hyderabad in 2010 and plenary speaker at Foundations of Computational Mathematics 2008 in Hong Kong. He is an associate editor of Computational Complexity, and an editor of the journal Foundations of Computational Mathematics. He served as a workshop co-organizer for the Foundations of Computational Mathematics conferences (2005, 2008, 2011), for the Special Year on Applications of Algebraic Geometry (IMA 2006/2007), and for the Oberwolfach workshops on Complexity Theory (2009, 2012). His research interests lie in algebraic complexity theory: both the design of efficient algorithms for algebraic problems, and the quest for lower bounds.