Gradient-based methods for sparse recovery

Details Gradient-based methods for sparse recovery Gradient-based methods for sparse recovery

2009-12-09

arxiv.org/abs/0912.1660v1

Mathematics

Optimization and Control

16 pages, submitted to SIAM Journal on Imaging Sciences

Scientific paper

The convergence rate is analyzed for the SpaSRA algorithm (Sparse Reconstruction by Separable Approximation) for minimizing a sum $f (\m{x}) + \psi (\m{x})$ where $f$ is smooth and $\psi$ is convex, but possibly nonsmooth. It is shown that if $f$ is convex, then the error in the objective function at iteration $k$, for $k$ sufficiently large, is bounded by $a/(b+k)$ for suitable choices of $a$ and $b$. Moreover, if the objective function is strongly convex, then the convergence is $R$-linear. An improved version of the algorithm based on a cycle version of the BB iteration and an adaptive line search is given. The performance of the algorithm is investigated using applications in the areas of signal processing and image reconstruction.

Affiliated with

Also associated with

No associations

Rating

Gradient-based methods for sparse recovery 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 Gradient-based methods for sparse recovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gradient-based methods for sparse recovery will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-275570