Computer Science – Information Theory
Scientific paper
2009-04-07
Computer Science
Information Theory
6 pages, o figures, partially submitted to Signale Processing Letter
Scientific paper
There is a recent surge of interest in developing algorithms for finding sparse solutions of underdetermined systems of linear equations $y = \Phi x$. In many applications, extremely large problem sizes are envisioned, with at least tens of thousands of equations and hundreds of thousands of unknowns. For such problem sizes, low computational complexity is paramount. The best studied $\ell_1$ minimization algorithm is not fast enough to fulfill this need. Iterative thresholding algorithms have been proposed to address this problem. In this paper we want to analyze two of these algorithms theoretically, and give sufficient conditions under which they recover the sparsest solution.
No associations
LandOfFree
Coherence Analysis of Iterative Thresholding Algorithms 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 Coherence Analysis of Iterative Thresholding Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coherence Analysis of Iterative Thresholding Algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-314829