The Ellipsoid Algorithm - Lecture 19a of CS Theory Toolkit

Explore the Ellipsoid Algorithm in this graduate-level lecture from Carnegie Mellon University's "CS Theory Toolkit" course. Delve into solving Linear Programming in polynomial time and convex optimization using only a separation oracle. Learn about the problem, algorithm, analysis, and the concept of separation oracles. Gain insights from recommended resources like "Geometric Algorithms and Combinatorial Optimization" and "Laplacian eigenvalues and the maximum cut problem." Taught by Ryan O'Donnell, this 31-minute video offers a comprehensive overview of this advanced topic in theoretical computer science.