BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:Divide and conquer: splitting algorithms for inverse problems
DTSTART:20101209T100000
DTSTAMP:20260406T124139Z
UID:86033318b8850b77059d2e92b15590a8e7d7779ea6fc0b1404b0786b
CATEGORIES:Conferences - Seminars
DESCRIPTION: Jalal M. Fadili\nThis talk will focus on several optimization
  problems involved in inverse problems where the solution is assumed to be
  sparsely represented in an overcomplete dictionary of waveforms. Such pro
 blems appear in many fields including image and signal processing\, and ha
 ve\nattracted even more interest since the emergence of the compressed sen
 sing theory. In this talk\, we formalize many of these problems within a u
 nified and versatile framework of convex optimization theory\,\nand invoke
  tools from convex analysis (e.g. duality\, proximity operators) and maxim
 al monotone operator splitting. We show how fast iterative splitting algor
 ithms can be used to solve these problems in their primal or dual versions
 . \nJalal M. Fadili graduated from the Ecole Nationale Supérieure d'Ingé
 nieurs (ENSI) de Caen\, France\, and received the M.Sc. and Ph.D. degrees 
 in signal and image processing from the University of Caen. He has been an
  Associate Professor of signal and image processing since September 2001 a
 t ENSI.
LOCATION:ELG 120
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR