Efficiency of weak greedy algorithms for \(m\)-term approximations (Q294506): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Analysis of orthogonal multi-matching pursuit under restricted isometry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robustness of orthogonal matching pursuit under restricted isometry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear approximation by trigonometric sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of almost greedy bases in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The thresholding greedy algorithm, greedy bases, and duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue constants for the weak greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of some greedy algorithms in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-greedy bases and Lebesgue-type inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardy spaces \(H^p\) over non-homogeneous metric measure spaces and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lebesgue-type inequalities for quasi-greedy bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biorthogonal systems in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4439542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent boundedness of Marcinkiewicz integrals on non-homogeneous metric measure spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An example of an almost greedy uniformly bounded orthonormal basis for \(L_p(0,1)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and \(m\)-term trigonometric approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear methods of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation with regard to non-greedy bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3104395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of monogenic functions by higher order Szegő kernels on the unit ball and half space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for general biorthogonal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation of Morrey-Campanato and related smoothness spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254471 / rank
 
Normal rank

Latest revision as of 03:45, 12 July 2024

scientific article
Language Label Description Also known as
English
Efficiency of weak greedy algorithms for \(m\)-term approximations
scientific article

    Statements

    Efficiency of weak greedy algorithms for \(m\)-term approximations (English)
    0 references
    0 references
    0 references
    16 June 2016
    0 references
    \(m\)-term approximation
    0 references
    Lebesgue constants
    0 references
    weak thresholding greedy algorithm
    0 references
    weak Chebyshev greedy algorithm
    0 references
    quasi-greedy bases
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers