Greedy approximation in convex optimization (Q2343051)

From MaRDI portal
Revision as of 01:32, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Greedy approximation in convex optimization
scientific article

    Statements

    title
    Greedy approximation in convex optimization (English)
    0 references
    publication date
    4 May 2015
    0 references
    Mathematics Subject Classification ID
    41A46
    0 references
    65K05
    0 references
    41A65
    0 references
    46B20
    0 references
    zbMATH DE Number
    6432638
    0 references
    zbMATH Keywords
    sparse
    0 references
    optimization
    0 references
    greedy
    0 references
    Banach space
    0 references
    convergence rate
    0 references
    describes a project that uses
    CoSaMP
    0 references
    foba
    0 references
    OpenAlex ID
    W1970524360
    0 references
    arXiv ID
    1206.0392
    0 references
    cites work
    Gradient Pursuits
    0 references
    Q5621720
    0 references
    Q4215356
    0 references
    Q3998421
    0 references
    Q4125357
    0 references
    Q4076680
    0 references
    Weak greedy algorithms
    0 references
    Greedy approximation
    0 references
    Greedy Approximation
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2343051&oldid=35452725"
    Powered by MediaWiki