Sparse Approximation by Greedy Algorithms
From MaRDI portal
Publication:4609500
DOI10.1007/978-3-319-41945-9_7zbMath1453.41008arXiv1511.01846OpenAlexW2962862668MaRDI QIDQ4609500
Publication date: 3 April 2018
Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.01846
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- Lebesgue-type inequalities for quasi-greedy bases
- An inequality for the entropy numbers and its application
- On trigonometric n-widths and their generalization
- Nonlinear tensor product approximation of functions
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Trigonometric diameters of the Sobolev classes \(W^ r_ p\) in the space \(L_ q\)
- Nonlinear Kolmogorov widths
- Estimates of best bilinear approximations of functions and approximation numbers of integral operators
- Nonlinear approximation by trigonometric sums
- Nonlinear methods of approximation
- Greedy algorithms with regard to multivariate systems with special structure
- Greedy-type approximation in Banach spaces and applications
- Convergence of some greedy algorithms in Banach spaces
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
- Constructive sparse trigonometric approximation for functions with small mixed smoothness
- Greedy approximation with regard to non-greedy bases
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
- An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\)
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
- Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
- Sparse Approximation and Recovery by Greedy Algorithms
- Lebesgue-Type Inequalities for Greedy Approximation in Banach Spaces
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Greedy Approximation
- Tensor Spaces and Numerical Tensor Calculus
- Quasi-greedy bases and Lebesgue-type inequalities
- ESTIMATES OF THE BEST BILINEAR APPROXIMATIONS OF FUNCTIONS OF TWO VARIABLES AND SOME OF THEIR APPLICATIONS
- EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
- DIAMETERS OF SETS IN NORMED LINEAR SPACES AND THE APPROXIMATION OF FUNCTIONS BY TRIGONOMETRIC POLYNOMIALS
- Decomposition theorems and approximation by a “floating" system of exponentials
- Best $ M$-term trigonometric approximations of Besov classes of periodic functions of several variables
- Sequential greedy approximation for certain convex optimization problems
- On the existence of almost greedy bases in Banach spaces
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Greedy algorithm for general biorthogonal systems
- Greedy algorithms in Banach spaces
- Adaptive greedy approximations
