Fast Implementation of 1-Greedy Algorithm

Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 25)

Abstract

We present an algorithm for finding sparse solutions of the system of linear equations A x = b with the rectangular matrix A of size n ×N, where n < N. The algorithm basic constructive block is one iteration of the standard interior-point linear programming algorithm. To find the sparse representation we modify (reweight) each iteration in the spirit of Petukhov (Fast implementation of orthogonal greedy algorithm for tight wavelet frames. Signal Process. 86, 471–479 (2006)). However, the weights are selected according to the 1-greedy strategy developed in Kozlov and Petukhov (Sparse solutions for underdetermined systems of linear equations. In: Freeden, W., Nashed, M.Z., Sonar, T. (eds.) Handbook of Geomathematics, pp. 1243–1259. Springer, Berlin (2010)). Our algorithm combines computational complexity close to plain 1-minimization with the significantly higher efficiency of the sparse representations recovery than the reweighted 1-minimization (Candes et al.: Enhancing sparsity by reweighted 1 minimization. J. Fourier Anal. Appl. 14, 877–905 (2008) (special issue on sparsity)), approaching the capacity of the 1-greedy algorithm.

Keywords

Sonar Keystone 

References

  1. 1.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)MATHGoogle Scholar
  2. 2.
    Candès, E.J., Tao, T.: Decoding by linear programming. IEEE Trans. Inform. Theor. 51, 4203–4215 (2005)CrossRefGoogle Scholar
  3. 3.
    Candes, E.J., Wakin, M.B., Boyd, S.: Enhancing sparsity by reweighted 1 minimization. J. Fourier Anal. Appl. 14, 877–905 (2008) (special issue on sparsity)Google Scholar
  4. 4.
    Chartrand, R., Yin, W.: Iteratively reweighted algorithms for compressive sensing. In: Proceedings of International Conference on Acoustics, Speech, Signal Processing (ICASSP), pp. 3869–3872 (2008)Google Scholar
  5. 5.
    Daubechies, I., DeVore, R., Fornasier, M., Güntürk, C.S.: Iteratively re-weighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63, 1–38 (2010)MATHCrossRefGoogle Scholar
  6. 6.
    Donoho, D.: Compressed sensing. IEEE Trans. Inform. Theor. 52, 1289–1306 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Donoho, D., Tsaig, Y., Drori, I., Starck, J.: Sparse solutions of underdetermined linear equations by stagewise orthogonal matching pursuit. Report, Stanford University (2006)Google Scholar
  8. 8.
    Foucart, S., Lai, M.J.: Sparsest solutions of underdetermined linear systems via q-minimization for 0 ≤ q ≤ 1. Appl. Comp. Harmonic Anal. 26, 395–407 (2009)MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Kozlov, I., Petukhov, A.: Sparse solutions for underdetermined systems of linear equations. In: Freeden, W., Nashed, M.Z., Sonar, T. (eds.) Handbook of Geomathematics, pp. 1243–1259. Springer, Berlin (2010)CrossRefGoogle Scholar
  10. 10.
    Lai, M.-J., Wang, J.: An unconstrained l q minimization with 0 < q ≤ 1 for sparse solution of under-determined linear systems. SIAM J. Optim. 21, 82–101 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Natarajan, B.K.: Sparse approximate solution to linear systems. SIAM J. Comput. 24, 227–234 (1995)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Petukhov, A.: Fast implementation of orthogonal greedy algorithm for tight wavelet frames. Signal Process. 86, 471–479 (2006)MATHCrossRefGoogle Scholar
  13. 13.
    Rudelson, M., Vershynin, R.: Geometric approach to error correcting codes and reconstruction of signals. Int. Math. Res. Not. 64, 4019–4041 (2005)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  1. 1.University of GeorgiaAthensUSA
  2. 2.Algosoft TechBogartUSA

Personalised recommendations