USC Schedule of Classes

Fall 2014

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.
SectionSessionTypeTimeDaysRegisteredInstructorLocationSyllabusInfo
30388D048Lecture11:00-12:20pmTue, Thu
25 of 25
Shaddin DughmiVKC151PDF (50587 KB)feesession dates
Information accurate as of March 9, 2015 8:11 am.
Want to provide feedback on the upcoming redesign of Schedule of Classes? Join our Beta Software Program!