Computer Science 675:
Convex and Combinatorial Optimization (4.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.
| Section | Session | Type | Time | Days | Registered | Instructor | Location | Syllabus | Info |
|---|---|---|---|---|---|---|---|---|---|
| 30388D | 048 | Lecture | 3:00-6:20pm | Monday | 33 of 39 | Shaddin Dughmi | GFS207 |   |