BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon2023//talk//LFPAKE
BEGIN:VTIMEZONE
TZID:EST
BEGIN:STANDARD
DTSTART:20001029T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10;UNTIL=20061029T070000Z
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:STANDARD
DTSTART:20071104T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000402T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=4;UNTIL=20060402T080000Z
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20070311T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-juliacon2023-LFPAKE@pretalx.com
DTSTART;TZID=EST:20230728T114000
DTEND;TZID=EST:20230728T115000
DESCRIPTION:We present the Branch-and-Bound Performance Estimation Programm
 ing (BnB-PEP)\, a unified methodology for constructing optimal first-order
  methods for convex and nonconvex optimization. BnB-PEP poses the problem 
 of finding the optimal optimization method as a nonconvex but practically 
 tractable quadratically constrained quadratic optimization problem and sol
 ves it to certifiable global optimality using a customized branch-and-boun
 d algorithm.
DTSTAMP:20260610T031532Z
LOCATION:32-155
SUMMARY:Constructing Optimal Optimization Methods using BnB-PEP - Shuvomoy 
 Das Gupta
URL:https://pretalx.com/juliacon2023/talk/LFPAKE/
END:VEVENT
END:VCALENDAR