Accelerated projected gradient method for linear inverse problems with sparsity constraints

Regularization of ill-posed linear inverse problems via L1 penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an L1 penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to L1-constraints, using a gradient method, with projection on L1-balls. The corresponding algorithm uses again iterative soft-thresholding, now with a variable thresholding parameter. We also propose accelerated versions of this iterative method, using ingredients of the (linear) steepest descent method. We prove convergence in norm for one of these projected gradient methods, without and with acceleration.