BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:James Saunderson (Monash University) DTSTART:20200715T070000Z DTEND:20200715T080000Z DTSTAMP:20260424T100755Z UID:VAWebinar/5 DESCRIPTION:Title: Lifting for simplicity: concise descriptions of convex sets\nby Jame s Saunderson (Monash University) as part of Variational Analysis and Optim isation Webinar\n\n\nAbstract\nThis talk will give a selective tour throug h the theory and applications of lifts of convex sets. A lift of a convex set is a higher-dimensional convex set that projects onto the original set . Many interesting convex sets have lifts that are dramatically simpler to describe than the original set. Finding such simple lifts has significant algorithmic implications\, particularly for associated optimization probl ems. We will consider both the classical case of polyhedral lifts\, which are described by linear inequalities\, as well as spectrahedral lifts\, wh ich are defined by linear matrix inequalities. The tour will include discu ssion of ways to construct lifts\, ways to find obstructions to the existe nce of lifts\, and a number of interesting examples from a variety of math ematical contexts. (Based on joint work with H. Fawzi\, J. Gouveia\, P. Pa rrilo\, and R. Thomas).\n LOCATION:https://researchseminars.org/talk/VAWebinar/5/ END:VEVENT END:VCALENDAR