Lecture 2 Piecewise-linear optimization
Lecture 2 Piecewise-linear optimization
Lecture 2 Piecewise-linear optimization
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Sparse signal recovery via l 1 -norm minimization<br />
• ˆx ∈ R n is unknown signal, known to be very sparse<br />
• we make <strong>linear</strong> measurements y = Aˆx with A ∈ R m×n , m < n<br />
estimation by l 1 -norm minimization: compute estimate by solving<br />
minimize ‖x‖ 1<br />
subject to Ax = y<br />
estimate is signal with smallest l 1 -norm, consistent with measurements<br />
equivalent LP (variables x, u ∈ R n )<br />
minimize 1 T u<br />
subject to −u ≤ x ≤ u<br />
Ax = y<br />
<strong>Piecewise</strong>-<strong>linear</strong> <strong>optimization</strong> 2–13