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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30133D048Lecture2:00-5:20pmWednesday23 of 25Shaddin DughmiKAP159feesession datesbook list
Information accurate as of October 3, 2018 10:51 am.