Computer Science 675:
Convex and Combinatorial Optimization (3.0 units)
Topics include: Convex sets and functions; convex optimization problems; geometric and Lagrangian duality; simplex algorithm; ellipsoid algorithm and its implications; matroid theory; submodular optimization. Prerequisites: CSCI 570 or CSCI 670. Recommended preparation: Mathematical maturity and a solid grounding in linear algebra.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30388D | 048 | Lecture | 11:00-12:20pm | Tue, Thu | 25 of 25 | Shaddin Dughmi | VKC151 | PDF (50587 KB) |   |