Back to Resources

An advanced course on optimization algorithms that highlights the interplay between discrete and continuous methods. Students study gradient descent, online optimization, and linear and semidefinite programming with duality, and examine network optimization, submodular optimization, and approximation algorithms built on continuous relaxations.
- Level
- Graduate
- Department
- CS
- Credits
- 4
- Prerequisites
- MA 123 & 124; CS 132
Last verified: August 22, 2026
Suggest a correction