TCS+ talk: Optimization, Complexity and Math (through the lens of one problem and one algorithm)

- Singularity of symbolic matrices: a basic problem in both computational complexity.
- Alternating Minimization: a basic heuristic in non-convex optimization.

I will explain how variants of this algorithm are applied to variants of this problem, how they are analyzed, and how the analysis gives rise to problems in and connections between a surprisingly diverse set of mathematical areas, including quantum information theory, non-commutative algebra and invariant theory, and analysis. Time permitting, we will discuss challenges this work raises in invariant theory and non-convex optimization.

NOTE: This is a remote talk and we will participate via Google Hangouts where we will also be able to ask questions.