BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180116T082214Z
DTSTART;TZID=America/Los_Angeles:20180209T161000
DTEND;TZID=America/Los_Angeles:20180209T170000
TRANSP:OPAQUE
SUMMARY:Bowen Lectures: Lecture 3: Mathematics and Computation (through the lens of one problem and one algorithm). Proving Analytic Inequalities.
UID:114447-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:Auditorium Calvin Laboratory (Simons Institute for the Theory of Computing)
DESCRIPTION:Avi Wigderson\, Institute for Advanced Study\n\nThe celebrated Brascamp-Lieb (BL) inequalities\, and their reverse form of Barthe\, is a powerful framework which unifies and generalizes many important inequalities in analysis\, convex geometry and information theory.\n\nI will exemplify BL inequalities\, building to the general set-up. I will describe the structural theory that characterizes existence and optimality of these inequalities in terms of their description (called BL-data). But can one efficiently compute existence and optimality from given BL-data?\n\nI will describe a recent polynomial time algorithm for these problems\, based on a natural alternate minimizaion approach and operator scaling analysis discussed in the first lecture. It also supplies alternative proofs to some of the structural results.\n\nThis algorithm may be viewed (via the structural theory) in two ways that make it potentially exciting for new applications in optimization. First\, it efficiently solves a large natural class of non-convex programs. Second\, it efficiently solves a large natural class of linear programs with exponentially many inequalities.\n\nThis lecture is self-contained\, independent of the previous two. No special background is assumed. Most of this presentation is based on the paper https://arxiv.org/abs/1607.06711
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=114447&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20180116T082214Z
LAST-MODIFIED:20180116T082812Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR