YoVDO

The Ellipsoid Algorithm - Lecture 19a of CS Theory Toolkit

Offered By: Ryan O'Donnell via YouTube

Tags

Theoretical Computer Science Courses Linear Programming Courses Research Methodology Courses Convex Optimization Courses

Course Description

Overview

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.

Syllabus

Introduction
The Problem
Summary
Algorithm
Analysis
Separation Oracle


Taught by

Ryan O'Donnell

Related Courses

Convex Optimization
Stanford University via edX FA19: Deterministic Optimization
Georgia Institute of Technology via edX Applied Optimization For Wireless, Machine Learning, Big Data
Indian Institute of Technology Kanpur via Swayam Statistical Machine Learning
Eberhard Karls University of Tübingen via YouTube Convex Optimization
NIOS via YouTube