# Optimization Videos

(Difference between revisions)
 Revision as of 17:09, 26 August 2008 (edit)← Previous diff Revision as of 17:12, 26 August 2008 (edit) (undo)Next diff → Line 47: Line 47: [http://www.ima.umn.edu/recordings/New_Directions_Short_Course/ND6.4-15.07/candes6-14-07.ram June 14 2007]   '''Modern Convex Optimization''' [http://www.ima.umn.edu/recordings/New_Directions_Short_Course/ND6.4-15.07/candes6-14-07.ram June 14 2007]   '''Modern Convex Optimization''' : Unconstrained Minization ([itex]\approx[/itex] 11 min in). : Unconstrained Minization ([itex]\approx[/itex] 11 min in). - + : Matlab example for Gradient Descent with exact Line Search ([itex]\approx[/itex] 19 min in). [http://www.ima.umn.edu/recordings/New_Directions_Short_Course/ND6.4-15.07/candes6-15-07.ram June 15 2007] [http://www.ima.umn.edu/recordings/New_Directions_Short_Course/ND6.4-15.07/candes6-15-07.ram June 15 2007]

## Compressive Sampling, Compressed Sensing, University Minnesota

### Emmanuel Candes

June 4 2007  Sparsity.

June 5 2007  (Audio begins 4 minutes into film.)

Norms.
Early work by pioneers ($LaTeX: \approx$ 16 minutes into film).
Deconvolution ($LaTeX: \approx$ 30 minutes into film).
Lasso, Basis Pursuit ($LaTeX: \approx$ 38 minutes in).
Wavelets, Curvelets, Ridgelets, sinusoids ($LaTeX: \approx$ 55 minutes in).
Overcomplete Dictionary ($LaTeX: \approx$ 57 minutes in).
Basis Pursuit ($LaTeX: \approx$ 1:03 hours in).
Feature separation ($LaTeX: \approx$ 1:12 hours in).
Barbara, Jean-Luc Stark ($LaTeX: \approx$ 1:15 hours in).
Magnetic Resonance Imaging (MRI) ($LaTeX: \approx$ 1:16 hours in).
Sample rate ($LaTeX: \approx$ 1:36 hours in).

June 6 2007  (If you only watch one Candes video, this is it.)

Recovery of Dirac comb, derivation of minimum sampling rate ($LaTeX: \approx$ 11 minutes into film).
4:1 sample to sparsity rule ($LaTeX: \approx$ 21 minutes into film).
Candes' Matlab code ($LaTeX: \approx$ 25 minutes in).
Fundamental premises of Compressed Sensing:  sparsity  and  incoherence  ($LaTeX: \approx$ 29 minutes in).

June 11 2007  (Audio back at 17 minutes into film.)

Matlab ($LaTeX: \approx$ 1:15).
MRI phantom with noise using Dantzig ($LaTeX: \approx$ 1:28).
Imaging fuel cells ($LaTeX: \approx$ 1:31).
Subsampling ($LaTeX: \approx$ 1:36).

June 13 2007   Connections with Information and Coding Theory

error correction (since the beginning).
Matlab decode ($LaTeX: \approx$ 20 min in).
second error corruption model: gross error + quantization error ($LaTeX: \approx$ 29 min in).
Connection with the Sparse Recovery Problem ($LaTeX: \approx$ 57 min in).
Reed-Solomon code ($LaTeX: \approx$ 1:08 min in).
Matlab for Reed-Solomon code ($LaTeX: \approx$ 1:26 min in).

June 14 2007   Modern Convex Optimization

Unconstrained Minization ($LaTeX: \approx$ 11 min in).
Matlab example for Gradient Descent with exact Line Search ($LaTeX: \approx$ 19 min in).