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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20191103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d3104965608
DTSTART;TZID=America/Toronto:20191205T093000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20191205T093000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/compmath-co-
 joint-seminar-andreas-griewank
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:CompMath & CO Joint Seminar - Andreas Griewank
CLASS:PUBLIC
DESCRIPTION:TITLE: How can we optimize nonsmooth objectives globally?\n\nS
 peaker:\n Andreas Griewank\n\nAffiliation:\n Humboldt University\, Germany
 \n\nRoom:\n MC 5501\n\nABSTRACT:\n\nIn machine learning objective function
 s that are only piecewise smooth\nand should be globally minimized abound.
  The standard method of\ndealing with them is to apply a stochastic gradie
 nt method\ndisregarding the rare points of nonsmoothness and hoping for th
 e best\nas far as global optimality of the computed solution is concerned.
DTSTAMP:20260406T014545Z
END:VEVENT
END:VCALENDAR