Bounded gradient projection methods for sparse signal recovery

The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of values. With these additional constraints on the estimate, the resulting constrained minimization problem is more challenging to solve. In previous work, we proposed a gradient projection approach for solving this type of minimization problem with nonnegativity constraints. In this paper, we generalize this approach to solve any bound-constrained 2- 1 minimization problem. Our method is based on solving the Lagrangian dual problem, and we show that by constraining the solution to known a priori bounds within the optimization method, we can obtain a more accurate estimate than simply thresholding the solution from the unconstrained minimization problem. Numerical results are presented to demonstrate the effectiveness of this approach.

• Type: Journal
• Year: 2011
• Where: ICASSP
• Authors: James Hernandez, Zachary T. Harmany, Daniel Thompson, Roummel F. Marcia
• Keywords: Gradient Projection, ICASSP 2011, Minimization Problem, Signal Minimization Problem, Signal Processing