15.099 | Fall 2003 | Graduate

Readings in Optimization

Lecture Notes

Semidefinite Programming (SDP) and the Goemans-Williamson MAXCUT Paper

Description:

Lecture presentation on an alternate view of linear programming, symmetric and semidefinite matrices, SDP, SDP duality, approximately solving MAXCUT using SDP and random vectors, and interior-point methods for SDP.

Resource Type:
Lecture Notes
pdf
789 kB
Semidefinite Programming (SDP) and the Goemans-Williamson MAXCUT Paper

Course Info

Fall 2003
Lecture Notes
Presentation Assignments with Examples