Non-convex sparse regularisation (Q847742)

From MaRDI portal
Revision as of 14:35, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Non-convex sparse regularisation
scientific article

    Statements

    Non-convex sparse regularisation (English)
    0 references
    0 references
    19 February 2010
    0 references
    The author investigates the Tikhonov regularization on the space of quadratic summable sequences, with a very general weighted regularization functional \(T_\alpha\), associated to the solution of an operator equation. The penalty term of the regularization functional is a linear combination, with positive weights, of the values of a given positive function \(\Phi\), multiplied by a positive parameter \(\alpha\). Under some imposed conditions on the function \(\Phi\), the penalty functional term is proved to be weak lower semi-continuous and weak coercitive. Many concrete examples of such functions satisfying these conditions, are presented. As a consequence, it follows that the regularization functional \(T_\alpha\) satisfies the main properties of a regularization method and thus the existence of minimisers for this functional. Also, it implies the convergence of minimisers to the solution of the linear operator equation. A central focus of this paper lies on the possible application of the considered regularization method to the recovery of sparse sequences. A sufficient condition is formulated that enforces the minimisers of the regularization functional to be sparse. Linear convergence of minimisers for a non-convex regularization functional is proved in Theorem 5.1.
    0 references
    Tikhonov regularization
    0 references
    convergence rates
    0 references
    space of quadratic summable sequences
    0 references
    penalty functional
    0 references
    linear operator
    0 references
    sparse sequences
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references