~/talk

Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints

links:none on file
slides:none on file

Claims that optimization algorithms map to a linear dynamical plant plus a nonlinear gradient block and that stability/rate can be certified by searching for Lyapunov functions via integral quadratic constraints leading to small semidefinite programs. Implements an off-by-one IQC to certify Nesterov‑style accelerated rates (within a constant) by solving tiny LMIs; heavy‑ball shows a surprising limit — a simple 1D counterexample with condition number ~16 produces a limit cycle so it fails certification. Also runs grid synthesis (Julia) to produce noise‑robust accelerated updates.

AI-written summary · about

  1. 0:00Introduction
  2. 0:26Controls and optimization
  3. 2:20Controls for optimization
  4. 3:59First order methods
  5. 7:20Acceleration methods
  6. 10:20Nesterov's method
  7. 13:03Control theory framework
  8. 17:08Modeling algorithms as systems
  9. 22:47Analyzing convergence
  10. 24:49Linear matrix inequalities
  11. 29:40General convex functions
  12. 34:53Integral quadratic constraints
  13. 38:55Sufficient conditions
  14. 41:51Sector inequality proof
  15. 44:18Method comparison
  16. 49:28Off-by-one IQCs
  17. 55:40Heavy ball instability
  18. 58:57Synthesis and future work
  19. 1:02:53Q&A session
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.