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:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a72ba5c61086
DTSTART;TZID=America/Toronto:20260807T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260807T110000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/masters-thes
 is-presentation-ziwen-wang-solving-linear
SUMMARY:Master's Thesis Presentation - ZiWen Wang - Solving Linear Programs
 \nwith very Tall Constraint Matrices
CLASS:PUBLIC
DESCRIPTION:SPEAKER: \n ZiWen Wang\n\nSUPERVISOR:\n Levent Tuncel\n\nLOCAT
 ION:\n MC 5479\n\nABSTRACT: \n\nGiven an LP with tall and skinny constrai
 nt matrix\, we will\nexploit this property and study an algorithm invent
 ed by Clarkson\n[8]. Although this algorithm has\nbeen around for over 30
  years\, there were no software or\nimplementation that could be found on
 line\, nor there be any\nbenchmarks for these special tall and skinny LP 
 s. We will describe\nsome variants and changes to the algorithm aiming f
 or practical\nperformancesto close this gap.\n\nWe also study a first orde
 r algorithm aimed for large scale LP\ns proposed by a group of researche
 rs from Google [2]\, [3] called\nPDLP. And compare it with Clarkson’s a
 lgorithm.
DTSTAMP:20260805T042148Z
END:VEVENT
END:VCALENDAR