Estimates of the Restricted Isometry Constant in Super Greedy Algorithms
Xiujie Wei, Peixin Ye · International Journal of Future Generation Communication and Networking · 2015
Orthogonal Super Greedy Algorithm (OSGA) is a super greedy-type algorithm for sparse approximation. We analyze the convergence of OSGA based on Restricted Isometry Property (RIP). Our main conclusion is that if a matrix satisfies the Restricted Isometry Property of order [ sK ] with isometry constant, then OSGA ( s ) can exactly recover any K -sparse signal x from yx in at most K iterations.