ConceptTheory & Algos
Ellipsoid algorithm
An algorithm that solves linear programs in polynomial time.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Linear programming2Separation oracle2Convex bodies1Convex optimization1Convex sets1Cutting-plane method1Hyperplane1Linear algebra1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Ryan O'Donnell
An algorithm that can solve linear programs in polynomial time given a separation oracle.Stephen Boyd
An algorithm for minimizing a convex function by localizing the optimal point in an ellipsoid and iteratively refining it using subgradients and minimum volume enclosing ellipsoids.Santosh Vempala
An algorithm that solves convex optimization and separation problems in polynomial time using a sequence of shrinking ellipsoids.
Lectures that assume it
1Connections
10The lectures that define it or assume it, and the concepts next to it.