BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ALOP - ECPv6.17.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ALOP
X-ORIGINAL-URL:https://alop.uni-trier.de
X-WR-CALDESC:Events for ALOP
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20160327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20161030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20171029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20170206T160000
DTEND;TZID=Europe/Berlin:20170206T180000
DTSTAMP:20170120T085952Z
CREATED:20170120T085700Z
LAST-MODIFIED:20170120T085952Z
UID:997-1486396800-1486404000@alop.uni-trier.de
SUMMARY:ALOP Colloquium with Dr. Bart Vandereycken
DESCRIPTION:On Monday\, February 6\, 2017\,  Dr. Bart Vandereycken from the University of Geneva will join the ALOP-Colloquium and present his recent work \n Manifold optimization for low rank matrix and tensor completion \nThe minimisation of a smooth objective function subject to (matrix) rank constraints can sometimes be very effectively solved by methods from Riemannian optimisation. This is for instance the case with the low-rank matrix and tensor completion problems However\, the standard theory of Riemannian optimisation leaves some questions unanswered regarding its theoretical and practical application. I will focus on two such questions. The first is how the (Riemannian) metric has a significant impact on the convergence of the numerical methods which I will illustrate by deriving recovery guarantees assuming RIP. The second topic is rank adaptivity. In rank-constrained optimisation\, the rank is typically not known and instead one is searching for the smallest rank satisfying a certain criterion\, like a small residual. I will explain how the geometry of the tangent cone of the variety of matrices of bounded rank can be incorporated so as to obtain rank adaptive algorithms that stay true to the manifold paradigm. \n  \nAt 15:45 there will be a coffee hour in E10. The presentation will take place in HS9 at 16:15.
URL:https://alop.uni-trier.de/event/alop-colloquium-with-dr-bart-vandereycken/
LOCATION:Trier University\, E Building\, Universitätsring 15\, Trier\, Germany
CATEGORIES:Colloquium
ORGANIZER;CN="Research Training Group ALOP at Trier University":MAILTO:OptimizationDays@uni-trier.de
END:VEVENT
END:VCALENDAR