BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20221202T181705
DTSTART;TZID=America/Detroit:20221202T090000
DTEND;TZID=America/Detroit:20221202T100000
SUMMARY:Workshop / Seminar:Variational Analysis and Optimization Seminar
DESCRIPTION:In this talk\, we first discuss a connection between the Halpern fixed-point iteration and Nesterov's accelerated schemes for a root-finding problem involving a co-coercive operator. We also study this connection for different recent schemes\, including extra anchored gradient method and its variants. We show how the convergence results from one scheme can be transferred to another. Next\, we develop a randomized block-coordinate algorithm for solving the above root-finding problem\, which is different from existing randomized coordinate methods in optimization. Finally\, we consider the applications of this randomized coordinate scheme to monotone inclusions and finite-sum monotone inclusions. The latter one can be applied to a federated learning setting. Speaker(s): Quoc Tran-Dinh (University of North Carolina at Chapel Hill)
UID:99966-21798945@events.umich.edu
URL:https://events.umich.edu/event/99966
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:Off Campus Location
CONTACT:
END:VEVENT
END:VCALENDAR