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.
30133D048Lecture2:00-3:50pmMon, Wed27 of 31Shaddin DughmiVHE210session dates
Information accurate as of October 6, 2022 11:00 am.
Did you find what you needed today? Let us know by taking a short survey.