The power of LP and SDP hierarchies and integrality gaps through semidefinite programming duality

ACO Student Seminar
Thursday, April 2, 2009 - 1:30pm for 2 hours
Skiles 255
Alexandra Kolla – UC Berkeley
Annette Rohrs
In the first part of the talk, I am going to give an introduction and overview of linear and semidefinite programming hierarchies. I will mostly review known integrality gaps for such programs and try to give an intuition of why we currently lack strong techniques for designing rounding algorithms. In the second part of the talk I will focus on the stronger SDP Lasserre hierarchy. In contrast with the previous LP and SDP hierarchies, very few examples of integrality gap instances are known to date. I will present a recent technique for designing such instances and discuss open problems in the area.