Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Stable signal recovery from incomplete and inaccurate measurements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing and best 𝑘-term approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal matching pursuit under the restricted isometry property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2948874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4188284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super greedy type algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Approximation and Recovery by Greedy Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2948883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak greedy algorithms / 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: SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On performance of greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Orthogonal Matching Pursuit / rank
 
Normal rank
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: Improved bounds on restricted isometry constant for orthogonal multi matching pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient image fusion with approximate sparse representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of weak greedy algorithms for \(m\)-term approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Recovery With Orthogonal Matching Pursuit Under RIP / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0219691317500291 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2603734932 / rank
 
Normal rank

Latest revision as of 08:29, 30 July 2024

scientific article; zbMATH DE number 6762875
Language Label Description Also known as
English
Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries
scientific article; zbMATH DE number 6762875

    Statements

    Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (English)
    0 references
    21 August 2017
    0 references
    best \(n\)-term approximation
    0 references
    weak orthogonal super greedy algorithm
    0 references
    incoherent properties
    0 references
    almost optimality
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references