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

From MaRDI portal
Revision as of 01:20, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    \(\ell_0\) regularization
    0 references
    iterative hard thresholding
    0 references
    proximal algorithm
    0 references
    convergence rate
    0 references
    \(\mathbb{R}\)-linear
    0 references

    Identifiers