Greedy type algorithms for RIP matrices. A study of two selection rules
نویسندگان
چکیده
On [24] some consequences of the Restricted Isometry Property (RIP) of matrices have been applied to develop a greedy algorithm called “ROMP” (Regularized Orthogonal Matching Pursuit) to recover sparse signals and to approximate non-sparse ones. These consequences were subsequently applied to other greedy and thresholding algorithms like “SThresh”, “CoSaMP”, “StOMP” and “SWCGP”. In this paper, we find another consequence of the RIP property and use it to analyze the approximation to k-sparse signals with Stagewise Weak versions of Gradient Pursuit (SWGP), Matching Pursuit (SWMP) and Orthogonal Matching Pursuit (SWOMP) algorithms described in in [5]. We combine the above mentioned algorithms with another selection rule similar to the ones that appeared in [8] and [15] showing that results are obtained with less restrictions in the RIP constant, but we need a smaller threshold parameter for the coefficients. The results of some experiments are shown.
منابع مشابه
Convergence Rates for Greedy Kaczmarz Algorithms, and Randomized Kaczmarz Rules Using the Orthogonality Graph
The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a non-asymptotic convergence rate analysis for this algorithm, spurring numerous extensions and generalizations of the Kaczmarz method. Rather than the random...
متن کاملConvergence Rates for Greedy Kaczmarz Algorithms, and Faster Randomized Kaczmarz Rules Using the Orthogonality Graph
The Kaczmarz method is an iterative algorithm for solving systems of linear equalities and inequalities, that iteratively projects onto these constraints. Recently, Strohmer and Vershynin [J. Fourier Anal. Appl., 15(2):262-278, 2009] gave a non-asymptotic convergence rate analysis for this algorithm, spurring numerous extensions and generalizations of the Kaczmarz method. Rather than the random...
متن کاملPhase Transitions for Greedy Sparse Approximation Algorithms
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, solutions of underdetermined linear systems of equations. Many such algorithms have now been proven using the ubiquitous Restricted Isometry Property (RIP) [9] to have optimal-order uniform recovery guarantees. However,...
متن کاملConvergence Rates for Greedy Kaczmarz Algorithms
We discuss greedy and approximate greedy selection rules within Kaczmarz algorithms for solving linear systems. We show that in some applications the costs of greedy and randomized rules are similar, and that greedy selection gives faster convergence rates. Further, we give a multi-step analysis of a particular greedy rule showing it can be much faster when many rows are orthogonal.
متن کاملNew Solutions for Singular Lane-Emden Equations Arising in Astrophysics Based on Shifted Ultraspherical Operational Matrices of Derivatives
In this paper, the ultraspherical operational matrices of derivatives are constructed. Based on these operational matrices, two numerical algorithms are presented and analyzed for obtaining new approximate spectral solutions of a class of linear and nonlinear Lane-Emden type singular initial value problems. The basic idea behind the suggested algorithms is basically built on transforming the eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1305.6954 شماره
صفحات -
تاریخ انتشار 2012