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

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

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

Algorithms for the Best Simultaneous Uniform Approximation of a Family of Functions Continuous on a Compact Set by a Chebyshev Subspace

By Hnatyuk Y.V.  

Ukrainian Mathematical Journal, Vol. 55, Iss. 3, 2003-03 ,pp. : 355-376

Springer Publishing Company

Access to resources Recommend Favorite

Performance comparisons of greedy algorithms in compressed sensing

By  

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

John Wiley & Sons Inc

Access to resources Recommend Favorite