Fall 2019 — 40391 Topics in computer science and optimization

This course is an introduction to algorithms for combinatorial optimization problems and for convex optimization problems. Topics will include greedy and dynamic programming approaches to network optimization problems, backtracking, Metropolis-type algorithms, linear programming, gradient descent, mirror descent, and Follow-the-Regularized-Leader algorithm for online convex optimization.