BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260920T212433Z
UID:Seminar-dept-1226@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20240326T130000
DTEND:20240326T140000
SUMMARY:School Seminar Series
DESCRIPTION:Dr. Alexandros Hollender: The Complexity of Computing KKT Solutions of Quadratic Programs\n\nIt is well known that solving a (non-convex) quadratic program is NP-hard. We show that the problem remains hard even if we are only looking for a Karush-Kuhn-Tucker (KKT) point, instead of a global optimum. Namely, we prove that computing a KKT point of a quadratic polynomial over the domain [0,1]^n is complete for the class CLS = PPAD ∩ PLS.\n\n\n\nBased on joint work with John Fearnley, Paul W. Goldberg, and Rahul Savani.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1226
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR