Topics in Optimization

Catalog description

This course will cover various topics in discrete and continuous optimization. Topics include graph algorithms, dynamic programming, linear programming, convex optimization and coarse-to-fine methods. Prerequisites: basic theory of algorithms (at the level of an undergraduate algorithms course) and linear algebra.