Uploaded June 2020 | Updated November 2026, 2 days ago
Some definitional aspects of SDP (semidefinite programming) and PSD (positive semidefinite matrices), as well as how the SDP relaxation for Max-Cut can be solved in polynomial time. Lecture 19c 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 (rebeccakphoto.com/)
Some definitional aspects of SDP (semidefinite programming) and PSD (positive semidefinite matrices), as well as how the SDP relaxation for Max-Cut can be solved in polynomial time. Lecture 19c 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 (rebeccakphoto.com/)










