BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:A semidefinite programming hierarchy for geometric packing problem
 s - de Laat\, D (Technische Universiteit Delft)
DTSTART:20130718T090000Z
DTEND:20130718T093000Z
UID:TALK46279@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:Geometric packing problems can be modeled as maximum independe
 nt set problems in infinite graphs. Computing the independence number is N
 P-hard. To get a chain of improving upper bounds for finite graphs one can
  formulate the problem as a polynomial optimization problem and then use t
 he Lasserre hierarchy. We generalize this hierarchy to infinite graphs usi
 ng conic optimization over cones of positive kernels and measures of posit
 ive type. For finite graphs it is known that the hierarchy attains the ind
 ependence number after finitely many steps. We show that this is also true
  for the generalized hierarchy if the infinite graph corresponds to a pack
 ing problem. Based on joint work with Frank Vallentin.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR