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:69d27c8ea35c5
DTSTART;TZID=America/Toronto:20210909T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210909T100000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/optimization
 -theory-algorithms-applications-lecture-series-2
SUMMARY:Optimization: Theory\, Algorithms\, Applications Lecture Series (Th
 e\nFields Institute) - Radu Ioan Bot
CLASS:PUBLIC
DESCRIPTION:TITLE: Factorization of completely positive matrices using ite
 rative\nprojected gradient steps\n\nSpeaker:\n Radu Ioan Bot\n\nAffiliatio
 n:\n University of Vienna\n\nZoom:\n Register\n[https://www.fields.utoront
 o.ca/cgi-bin/register?form_selection=optimization]\nthrough The Fields Ins
 titute\n\nABSTRACT:\n\nWe aim to factorize a completely positive matrix by
  using an\noptimization approach which consists in the minimization of a\n
 nonconvex smooth function over a convex and compact set. To solve this\npr
 oblem we propose a projected gradient algorithm with parameters that\ntake
  into account the effects of relaxation and inertia. Both\nprojection and 
 gradient steps are simple in the sense that they have\nexplicit formulas a
 nd do not require inner loops. We show that the\nsequence of generated ite
 rates
DTSTAMP:20260405T151526Z
END:VEVENT
END:VCALENDAR