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:69d27c962c301
DTSTART;TZID=America/Toronto:20210910T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210910T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-jane-ye
SUMMARY:Tutte Colloquium - Jane Ye
CLASS:PUBLIC
DESCRIPTION:TITLE: On solving bilevel programming problems\n\nSpeaker:\n J
 ane Ye\n\nAffiliation:\n University of Victoria\n\nZoom:\n Please email E
 mma Watson\n\nABSTRACT:\n\nA bilevel programming problem is a sequence of 
 two optimization\nproblems where the constraint region of the upper level 
 problem is\ndetermined implicitly by the solution set to the lower level p
 roblem.\nIt can be used to model a two-level hierarchical system where the
  two\ndecision makers have different objectives and make their decisions o
 n\ndifferent levels of hierarchy. Recently more and more applications\ninc
 luding those in machine learning have been modelled as bilevel\noptimizati
 on problems. In this talk\, I will report some recent\ndevelopments in opt
 imality conditions and numerical algorithms for\nsolving this class of ver
 y difficult optimization problems.
DTSTAMP:20260405T151534Z
END:VEVENT
END:VCALENDAR