l^1 Greedy Algorithm for Finding Solutions of Underdetermined Linear Systems
A. Petukhov and I. Kozlov
A. Petukhov and I. Kozlov
Seminar • 10 March 2008 • BM 5.202
AbstractFinding sparse solutions of underdetermined systems Ax=b is a hot topic of the last years. Many problems of information theory (data compression, error correcting codes, compressed sensing, etc.) can be reformulated in terms of this problem. We are going to discuss different applications of this problem and to present a new algorithm solving the problem for wider range of the input data. The known algorithms are represent two competing classes: l^1 minimization and orthogonal greedy methods. Our new algorithm may serve as "a peace agreement" between the two competing approaches.