BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:"Programming" Problems - Bingjie Wang\, Churchill College
DTSTART:20141112T194000Z
DTEND:20141112T203000Z
UID:TALK55965@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Semidefinite Programming (SDP) is a mathematical technique tha
 t came into prominence in the late 1990s with the rise of Machine Learning
 . In fact\, SDPs can be used for classification. In addition\, SDPs repres
 ent a wide range of optimization problems from scheduling to maximal viola
 tions of quantum inequalities. This talk will explore the foundations of S
 DP in Linear Programming (LP) and some applications of LP. Then\, the talk
  will continue onto SDPs and the landmark relaxation of the NP-Complete MA
 X-CUT problem that first demonstrated the power of SDPs. The talk will con
 clude with the links between LP\, SDP\, and other “programming” proble
 ms with respect to complexity.
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR