Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

Details Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints

2007-06-28

arxiv.org/abs/0706.4297v2

Mathematics

Numerical Analysis

24 pages, 5 figures. v2: added reference, some amendments, 27 pages

Scientific paper

Regularization of ill-posed linear inverse problems via $\ell_1$ penalization has been proposed for cases where the solution is known to be (almost) sparse. One way to obtain the minimizer of such an $\ell_1$ penalized functional is via an iterative soft-thresholding algorithm. We propose an alternative implementation to $\ell_1$-constraints, using a gradient method, with projection on $\ell_1$-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.

Affiliated with

Also associated with

No associations

Rating

Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Accelerated Projected Gradient Method for Linear Inverse Problems with Sparsity Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-457331