Non-convex sparse regularisation (Q847742): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A generalized conditional gradient method for nonlinear operator equations with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear convergence of iterative soft-thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization with non-convex separable constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear wavelet image processing: variational problems, compression, and noise removal through wavelet shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximal Thresholding Algorithm for Minimization over Orthonormal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signal Recovery by Proximal Forward-Backward Splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3414549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain decomposition methods for linear inverse problems with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse regularization with <i> l <sup>q</sup> </i> penalty term / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semismooth Newton method for Tikhonov functionals with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence rates and source conditions for Tikhonov regularization with sparsity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Banach Space Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimization of a Tikhonov functional with a non-convex sparsity constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational methods in imaging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just relax: convex programming methods for identifying sparse signals in noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5332803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tikhonov regularization with non-convex sparsity constraints / rank
 
Normal rank

Latest revision as of 12:02, 2 July 2024

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
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references
    0 references