This course teaches the Ellipsoid Algorithm, which can solve Linear Programming problems in polynomial time or convex optimization using a separation oracle. The course is part of a semester-long graduate program covering math and CS fundamentals for research in theoretical computer science. The teaching method involves lectures and resources from academic books. The intended audience for this course is graduate students and researchers in theoretical computer science.
The Ellipsoid Algorithm - Lecture 19a of CS Theory Toolkit
Overview
Syllabus
Introduction
The Problem
Summary
Algorithm
Analysis
Separation Oracle
Taught by
Ryan O'Donnell
