Super greedy type algorithms (Q1928073): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q219318 / rank
Normal rank
 
Property / author
 
Property / author: Vladimir N. Temlyakov / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2159665097 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1010.5423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lebesgue-type inequalities for greedy approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms and \(M\)-term approximation with regard to redundant dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak greedy algorithms / 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

Latest revision as of 01:53, 6 July 2024

scientific article
Language Label Description Also known as
English
Super greedy type algorithms
scientific article

    Statements

    Super greedy type algorithms (English)
    0 references
    0 references
    0 references
    2 January 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    super greedy algorithms
    0 references
    thresholding
    0 references
    convergence rate
    0 references
    incoherent dictionary
    0 references
    0 references
    0 references