CO 471 - Semi-Definite Optimization

Levent Tunçel

Spring 2014

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization by Levent Tunçel

Chapter 1 - Introduction
Chapter 2 - Duality Theory
Chapter 3 - Ellipsoid Method
Chapter 4 - Primal-Dual Interior-Point Methods
Chapter 5 - Approximation Algorithms Based on SDP
Chapter 6 - Geometric Representations of Graphs
Chapters 7, 8, 9 - Lift-and-Project and Convex Relaxation Methods