Instructor: Akshay Ramachandran
Term: Winter II, 2025
We will cover the fundamental algorithms used for efficient convex optimization, with a focus on rigorous convergence analysis. At the end, you should have an understanding of why convex optimization algorithms work, and be able to effectively apply these tools to your own research. This course will be different from and complementary to CPSC 536M taught by Michael Friedlander in Term 1.
MW 12:30-2pm in DMP 201
| Date | Topic | Notes |
|---|---|---|
| Week 1 | Introduction | - |
| Week 2-3 | Convex sets and functions | Notes (prelim) |
| Week 3 | Cutting Plane Methods | Notes (prelim) |
| Week 4 | Convex Programming Duality and John's Ellipsoid | Notes (prelim) |
| Week 5-6 | Gradient Descent | — |
| Week 7 | Reading Week | — |
| Week 8-9 | Gradient Descent, Mirror Descent | — |
| Week 10-12 | Interior Point Methods | — |