Teaching

Lecture Notes

Here are some lecture notes that I have written over the years. Some I am still actively improving and all of them I am happy to continue polishing. If you see any typos or issues, feel free to email me.

• Optimization Algorithms: I used variants of these notes to accompany the courses Introduction to Optimization Theory and Optimization Algorithms which I created. 

• Discrete Mathematics and Algorithms: An Introduction to Combinatorial Optimization: I used these notes to accompany the course Discrete Mathematics and Algorithms.

• Optimization and Algorithmic Paradigms: Combinatorial Optimization Algorithms: I used these notes to accompany the course Optimization and Algorithmic Paradigms.

Teaching History

• MS&E 111X: Introduction to Optimization (Accelerated) (MS&E 111x / 211x): Spring '23

• Optimization and Algorithmic Paradigms (CS 261): Winter '23

• Optimization Algorithms (CS 369O / CME 334 / MS&E 312): Fall '22

• Discrete Mathematics and Algorithms (CME 305 / MS&E 315):  Winter '22, '21, '20, '19, '18

• Introduction to Optimization Theory  (CS 269O / MS&E 213): Fall '20, '19, Spring '19, '18, '17

• Almost Linear Time Graph Algorithms (CS 269G / MS&E 313): Fall '18, Winter '17

Talk Slides

• Efficiently Minimizing the Maximum Loss: slides on a line of work on the complexity of minimizing the maximum of convex, Lipschitz, loss functions