BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20131027T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20140330T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.6805.field_data.0@diag.uniroma1.it
DTSTAMP:20260407T211746Z
CREATED:20140203T162606Z
DESCRIPTION:The notion of 'identifiability' underpins the active-set philos
 ophy in optimization\, and often manifests itself in variational formulati
 ons seeking low-dimensional structure from high-dimensional data.  Beyond 
 the realm of convexity\, identifiability remains a fundamental property\, 
 occurring generically in semi-algebraic optimization.  I illustrate its re
 levance for two simple and popular nonconvex algorithms:  alternating proj
 ections and a proximal algorithm for composite optimization.Joint work wit
 h J. Bolte\, A. Daniilidis\, D. Drusvyatskiy and S. Wright
DTSTART;TZID=Europe/Paris:20140212T113000
DTEND;TZID=Europe/Paris:20140212T113000
LAST-MODIFIED:20200521T211813Z
LOCATION:Aula Magna - DIAG
SUMMARY:MORE@DIAG: Adrian Lewis (Cornell) Identifiability\, Nonconvexity\, 
 and Sparse Optimization Algorithms - Adrian Lewis (Cornell)
URL;TYPE=URI:http://diag.uniroma1.it/node/6805
END:VEVENT
END:VCALENDAR