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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e51108b53ed
DTSTART;TZID=America/Toronto:20210728T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210728T100000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/optimization
 -theory-algorithms-applications-lecture-series
SUMMARY:Optimization: Theory\, Algorithms\, Applications Lecture Series
CLASS:PUBLIC
DESCRIPTION:TITLE: A primal-dual interior-point algorithm fo rnonsymmetric
  conic\noptimization\n\nSpeaker:\n Erling D. Andersen\n\nAffiliation:\n Mo
 sek ApS\n\nZoom:\n Register through The Fields Institute\n[https://www.fie
 lds.utoronto.ca/cgi-bin/register?form_selection=optimization]\n\nABSTRACT:
 \n\nIt is well known that primal-dual interior-point algorithms for linear
 \noptimization can easily be extended to the case of symmetric conic\nopti
 mization\, as shown by Nesterov and Todd (NT) in their 1997 paer\nabout se
 lf-scaled barriers. Although many convex optimization problems\ncan be exp
 ressed using symmetric cones then models involving for\ninstance exponenti
 al functions do not belong to the class of symmetric\nconic optimization p
 roblems.
DTSTAMP:20260419T172944Z
END:VEVENT
END:VCALENDAR