BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20181221T160726Z
LOCATION:D220
DTSTART;TZID=America/Chicago:20181111T145800
DTEND;TZID=America/Chicago:20181111T150000
UID:submissions.supercomputing.org_SC18_sess160_ws_whpc116@linklings.com
SUMMARY:Large-Scale PDE-Constrained Optimization
DESCRIPTION:Workshop\nDiversity, Education, Hot Topics, Workshop Reg Pass\
 n\nLarge-Scale PDE-Constrained Optimization\n\nMarin\n\nOptimization of ti
 me-dependent PDE-constrained optimization problems is extremely challengin
 g from a computational perspective. Presume one forward simulation of a di
 fferential equation with N degrees of freedom, advancing in time for M tim
 esteps requires a time to solution T. In this case optimizing for a certai
 n parameter constrained by the PDE takes at least 2kT, where k is the numb
 er of iterations up to the convergence of the optimization scheme. We here
 by explore strategies for achieving maximum speedup under controlled incur
 red errors. It is noteworthy that high errors in the computation of the gr
 adient increase the number of iterations required to achieve convergence o
 f the optimization algorithm, which is, in essence, more damaging than any
  gains made in the computation of the PDE.
URL:https://sc18.supercomputing.org/presentation/?id=ws_whpc116&sess=sess1
 60
END:VEVENT
END:VCALENDAR