Performance comparisons of greedy algorithms in compressed sensing

E-ISSN： 1099-1506|22|2|254-282

ISSN： 1070-5325

Source： NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol.22, Iss.2, 2015-03, pp. : 254-282

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Simultaneous approximation by greedy algorithms

By Leviatan D. Temlyakov V.

Advances in Computational Mathematics, Vol. 25, Iss. 1-3, 2006-07 ,pp. : 73-90

Springer Publishing Company

Access to resources Recommend Favorite

Vector greedy algorithms

By Lutoborski A. Temlyakov V.N.

Journal of Complexity, Vol. 19, Iss. 4, 2003-08 ,pp. : 458-473

Elsevier

Access to resources Recommend Favorite

The best m-term approximation and greedy algorithms

By Temlyakov V.N.

Advances in Computational Mathematics, Vol. 8, Iss. 3, 1998-04 ,pp. : 249-265

Springer Publishing Company

Access to resources Recommend Favorite

A new approach to compressed sensing for NMR

MAGNETIC RESONANCE IN CHEMISTRY, Vol. 53, Iss. 11, 2015-11 ,pp. : 908-912

John Wiley & Sons Inc

Access to resources Recommend Favorite

On greedy approximation algorithms for a class of two-stage stochastic assignment problems

By Karademir Serdar Kong Nan Prokopyev Oleg A.

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 42-67

Taylor & Francis Ltd

Access to resources Recommend Favorite