The Ellipsoid Algorithm || @ CMU || Lecture 19a of CS Theory Toolkit
Автор: Ryan O'Donnell
Загружено: 2020-06-10
Просмотров: 5397
Описание:
The Ellipsoid Algorithm (sketched): solving Linear Programming in polynomial time, or convex optimization with just a separation oracle. Lecture 19a of "CS Theory Toolkit": a semester-long graduate course on math and CS fundamentals for research in theoretical computer science, taught at Carnegie Mellon University.
Resources for this lecture:
"Geometric Algorithms and Combinatorial Optimization" by Grötschel, Lovász, and Schrijver.
"Laplacian eigenvalues and the maximum cut problem" by Delorme and Poljak.
Taught by Ryan O'Donnell (https://www.cs.cmu.edu/~odonnell)
Course homepage on CMU's Diderot system: https://www.diderot.one/course/28/
Thumbnail photo by Rebecca Kiger (https://www.rebeccakphoto.com/)
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
