Sparse Approximation by Greedy Algorithms (Q4609500)

scientific article; zbMATH DE number 6855382

Language	Label	Description	Also known as
English	Sparse Approximation by Greedy Algorithms	scientific article; zbMATH DE number 6855382

Statements

instance of

scholarly article

0 references

title

Sparse Approximation by Greedy Algorithms (English)

0 references

published in

Springer Proceedings in Mathematics & Statistics

0 references

publication date

3 April 2018

0 references

full work available at URL

https://arxiv.org/abs/1511.01846

0 references

zbMATH Keywords

sparse approximation

0 references

greedy method

0 references

Lebesgue inequality

0 references

constructive argument

0 references

author

Vladimir N. Temlyakov

0 references

describes a project that uses

CoSaMP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Nonlinear tensor product approximation of functions

0 references

Decomposition theorems and approximation by a “floating" system of exponentials

0 references

Subspace Pursuit for Compressive Sensing Signal Reconstruction

0 references

Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations

0 references

Adaptive greedy approximations

0 references

Q4215356

0 references

Nonlinear approximation by trigonometric sums

0 references

On the existence of almost greedy bases in Banach spaces

0 references

Convergence of some greedy algorithms in Banach spaces

0 references

Quasi-greedy bases and Lebesgue-type inequalities

0 references

Lebesgue-type inequalities for quasi-greedy bases

0 references

EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES

0 references

Tensor Spaces and Numerical Tensor Calculus

0 references

DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS

0 references

Q4125357

0 references

On best $m$-term approximations and the entropy of sets in the space $L^ 1$

0 references

Q2752669

0 references

Sparse Approximation and Recovery by Greedy Algorithms

0 references

Trigonometric diameters of the Sobolev classes $W^ r_ p$ in the space $L_ q$

0 references

On trigonometric n-widths and their generalization

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit

0 references

An example of an almost greedy uniformly bounded orthonormal basis for $L_p(0,1)$

0 references

Best $ M$-term trigonometric approximations of Besov classes of periodic functions of several variables

0 references

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

0 references

Approximation rates for the hierarchical tensor format in periodic Sobolev spaces

0 references

Q3229514

0 references

Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces

0 references

Q3027578

0 references

Q3746284

0 references

ESTIMATES OF THE BEST BILINEAR APPROXIMATIONS OF FUNCTIONS OF TWO VARIABLES AND SOME OF THEIR APPLICATIONS

0 references

Q3834473

0 references

Estimates of best bilinear approximations of functions and approximation numbers of integral operators

0 references

Greedy algorithms with regard to multivariate systems with special structure

0 references

Nonlinear Kolmogorov widths

0 references

Greedy algorithms in Banach spaces

0 references

Nonlinear methods of approximation

0 references

Greedy-type approximation in Banach spaces and applications

0 references

Greedy Approximation

0 references

SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES

0 references

An inequality for the entropy numbers and its application

0 references

Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness

0 references

Constructive sparse trigonometric approximation for functions with small mixed smoothness

0 references

Greedy approximation with regard to non-greedy bases

0 references

Greedy algorithm for general biorthogonal systems

0 references

Sequential greedy approximation for certain convex optimization problems

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

Identifiers

zbMATH Open document ID

1453.41008

0 references

DOI

10.1007/978-3-319-41945-9_7

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4609500