BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.5.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20270314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20271107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261021T120000
DTEND;TZID=America/New_York:20261021T130000
DTSTAMP:20261007T191801Z
CREATED:20260917T155620Z
LAST-MODIFIED:20261007T191801Z
UID:10004046-1792584000-1792587600@cmsa.fas.harvard.edu
SUMMARY:What is a self-concordant barrier function?\, and what is an accelerated first-order algorithm?  (ICM Series: On the work of Yurii Nesterov)
DESCRIPTION:CMSA Q&A Seminar \nSpeaker: Robert M. Freund\, MIT \nTitle: What is a self-concordant barrier function?\, and what is an accelerated first-order algorithm?  (ICM Series: On the work of Yurii Nesterov) \nAbstract: The two most impactful contributions of Nesterov on both theory and computation in optimization are (i) self-concordant barriers for interior-point methods in convex optimization\, and (ii) accelerated first-order methods for convex optimization. My own research in continuous optimization – and indeed my perspective on the field of mathematical optimization — has been profoundly impacted by Nesterov. In this talk I aim to explain these two contributions – self-concordant barriers and accelerated first-order methods – and how they have fundamentally improved optimization both computationally and theoretically. \n  \n  \n 
URL:https://cmsa.fas.harvard.edu/event/cmsaqa_102126/
LOCATION:Common Room\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:CMSA Q&A Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/2026/09/CMSA-Q-A-Seminar-10.21.2026.docx-scaled.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20261021T120000
DTEND;TZID=America/New_York:20261021T130000
DTSTAMP:20261006T135023Z
CREATED:20261006T135023Z
LAST-MODIFIED:20261006T135023Z
UID:10004054-1792584000-1792587600@cmsa.fas.harvard.edu
SUMMARY:CMSA Q&A Seminar
DESCRIPTION:CMSA Q&A Seminar \nSpeaker: tba \n  \n 
URL:https://cmsa.fas.harvard.edu/event/cmsaqa_102826/
LOCATION:Common Room\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:CMSA Q&A Seminar
END:VEVENT
END:VCALENDAR