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
30199D048Lecture4:00-5:50pmMon, Wed32 of 33Shaddin DughmiSGM226feesession dates
Information accurate as of September 22, 2019 3:01 am.