BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d1e91d4d778
DTSTART;TZID=America/Toronto:20250207T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250207T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-levent-tuncel-2
SUMMARY:Tutte colloquium-Levent Tuncel
CLASS:PUBLIC
DESCRIPTION:TITLE: A New Complexity Analysis of Primal-Dual Interior-Point 
 Methods\nwith Applications to Hyperbolic Cone Programming\n\nSPEAKER:\n Le
 vent Tuncel\n\nAFFILIATION:\n University of Waterloo\n\nLOCATION:\n MC 550
 1\n\nABSTRACT: Primal-dual interior-point methods stand at the forefront o
 f\nconvex optimization\, distinguished by their theoretical efficiency and
 \npractical robustness. After presenting the fundamental \nstructure of t
 hese algorithms\, I will introduce a complexity measure\nfor a large famil
 y of primal-dual algorithms. A consequence of the new\nanalyses of this co
 mplexity measure is a substantial improvement of\nthe iteration \ncomplex
 ity bounds for these primal-dual algorithms on hyperbolic cone\nprogrammin
 g problems.\n\nThis talk is based on joint work with Joachim Dahl and Liev
 en\nVandenberghe.\n\n \n\n 
DTSTAMP:20260405T044621Z
END:VEVENT
END:VCALENDAR