BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20200329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260404T110135Z
UID:1579624200@ist.ac.at
DTSTART:20200121T173000
DTEND:20200121T183000
DESCRIPTION:Speaker: Stephan Eckstein\nhosted by M. Beiglböck\, N. Beresty
 cki\, L. Erdös\, J. Maas\nAbstract: The object of this talk are a class o
 f optimization problems which generalize the classical optimal transport s
 etting\, namely the class of linearly constrained optimal transport. After
  introducing the setting\, the talk focuses on certain regularization tech
 niques applicable to these optimization problems. Most notably\, these tec
 hniques include the entropic regularization of optimal transport\, which i
 s connected to the Schrödinger problem and the Sinkhorn algorithm. The ta
 lk discusses the basic question of when such a regularization is justifiab
 le\, i.e. when the regularized problem approximates the initial problem in
  a suitable sense. For simple cases\, positive results are presented\, whi
 le more generally this talk also showcases reformulations\, open questions
 \, specic examples\, and certain limitations.
LOCATION:SR 14\, 2 OG.\, OMP 1\, University of Vienna\, ISTA
ORGANIZER:birgit.oosthuizen-noczil@ist.ac.at
SUMMARY:Stephan Eckstein: Regularization of linearly constrained optimal tr
 ansport problems
URL:https://talks-calendar.ista.ac.at/events/2498
END:VEVENT
END:VCALENDAR