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:6a72ba5eed120
DTSTART;TZID=America/Toronto:20260807T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260807T120000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/masters-thes
 is-presentation-amaan-khan-study-first-order
SUMMARY:Master's Thesis Presentation - Amaan Khan - A Study of First-Order\
 nPrimal-Dual Algorithms for Linear Optimization
CLASS:PUBLIC
DESCRIPTION:SPEAKER: \n Amaan Khan\n\nSUPERVISOR:\n Levent Tuncel\n\nLOCAT
 ION: \n MC 5479\n\nABSTRACT: \n\nSecond-order Interior Point Methods (IP
 M) have been studied\nextensively over the past 80 years\, proving effecti
 ve for conic\noptimization. They can produce high-precision approximate so
 lutions in\nfew iterations. Each iteration is computationally expensive: T
 he core\nof each iteration is a large matrix inversion that scales poorly 
 with\nthe number of variables.\n\nIn large-scale applications\, we cannot 
 bear the per-iteration cost\n(perhaps due to lack of memory)\, so we inste
 ad turn to first-order\nmethods. We study a first-order IPM that uses a lo
 w-rank update scheme\nto replace the matrix inversion with significantly l
 ower per-iteration\ncost\, and compare this to other first-order methods f
 or solving LP at\nscale.
DTSTAMP:20260805T042150Z
END:VEVENT
END:VCALENDAR