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:68326d84dd444
DTSTART;TZID=America/Toronto:20210910T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210910T153000
URL:/combinatorics-and-optimization/events/tutte-colloq
 uium-jane-ye
SUMMARY:Tutte Colloquium - Jane Ye
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: On solving bilevel programming problems\n\n
 Speaker:\n Jane Ye\n\nAffiliation:\n University of Victoria\n\nZoom:\n Ple
 ase email Emma 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 l
 ower level problem.\nIt can be used to model a two-level hierarchical syst
 em where the two\ndecision makers have different objectives and make their
  decisions on\ndifferent levels of hierarchy. Recently more and more appli
 cations\nincluding those in machine learning have been modelled as bilevel
 \noptimization problems. In this talk\, I will report some recent\ndevelop
 ments in optimality conditions and numerical algorithms for\nsolving this 
 class of very difficult optimization problems.\n 
DTSTAMP:20250525T010820Z
END:VEVENT
END:VCALENDAR