A note on the complexity of proximal iterative hard thresholding algorithm (Q259117)

From MaRDI portal
Revision as of 15:36, 19 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A note on the complexity of proximal iterative hard thresholding algorithm
scientific article

    Statements

    A note on the complexity of proximal iterative hard thresholding algorithm (English)
    0 references
    0 references
    0 references
    11 March 2016
    0 references

    Identifiers