Calendar

Time interval: Events:

Friday, May 1, 2026

Posted January 24, 2026

Control and Optimization Seminar Questions or comments?

10:30 am – 11:20 am Note the Special Seminar Time. Zoom (click here to join)

Michael Friedlander, University of British Columbia SIAM Fellow
Seeing Structure Through Duality

Duality is traditionally introduced as a source of bounds and shadow prices. In this talk I emphasize a second role: revealing structure that enables scalable computation. Starting from LP complementary slackness, I describe a generalization called polar alignment that identifies which "atoms" compose optimal solutions in structured inverse problems. The discussion passes through von Neumann's minimax theorem, Kantorovich's resolving multipliers, and Dantzig's simplex method to arrive at sublinear programs, where an adversary selects worst-case costs from a set. The resulting framework unifies sparse recovery, low-rank matrix completion, and signal demixing. Throughout, dual variables serve as certificates that decode compositional structure.

Friday, May 8, 2026

Posted January 5, 2026
Last modified April 10, 2026

Control and Optimization Seminar Questions or comments?

9:30 am – 10:20 am Zoom (click here to join)

Necmiye Ozay, University of Michigan IEEE Fellow, and ONR Young Investigator, NASA Early Career Faculty, and NSF CAREER Awardee
Fundamental Limitations of Learning for Dynamics and Control

Data-driven and learning-based methods have attracted considerable attention in recent years both for the analysis of dynamical systems and for control design. While there are many interesting and exciting results in this direction, our understanding of fundamental limitations of learning for control is lagging. This talk will focus on the question of when learning can be hard or impossible in the context of dynamical systems and control. In the first part of the talk, I will discuss a new observation on immersions and how it reveals some potential limitations in learning Koopman embeddings. In the second part of the talk, I will show what makes it hard to learn to stabilize linear systems from a sample-complexity perspective. While these results might seem negative, I will conclude the talk with thoughts on how they can inspire interesting future directions.