Tikhonov regularization with ^0-term complementing a convex penalty: ^1-convergence under sparsity constraints
From MaRDI portal
Publication:2316708
Abstract: Measuring the error by an l^1-norm, we analyze under sparsity assumptions an l^0-regularization approach, where the penalty in the Tikhonov functional is complemented by a general stabilizing convex functional. In this context, ill-posed operator equations Ax = y with an injective and bounded linear operator A mapping between l^2 and a Banach space Y are regularized. For sparse solutions, error estimates as well as linear and sublinear convergence rates are derived based on a variational inequality approach, where the regularization parameter can be chosen either a priori in an appropriate way or a posteriori by the sequential discrepancy principle. To further illustrate the balance between the l^0-term and the complementing convex penalty, the important special case of the l^2-norm square penalty is investigated showing explicit dependence between both terms. Finally, some numerical experiments verify and illustrate the sparsity promoting properties of corresponding regularized solutions.
Recommendations
Cites work
- A convergence rates result for Tikhonov regularization in Banach spaces with non-smooth operators
- A variational approach to sparsity optimization based on Lagrange multiplier theory
- An extension of the variational inequality approach for obtaining convergence rates in regularization of nonlinear ill-posed problems
- Approximate source conditions for nonlinear ill-posed problems—chances and limitations
- Approximate source conditions in Tikhonov–Phillips regularization and consequences for inverse problems with multiplication operators
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Convergence rates for regularization with sparsity constraints
- Convergence rates in ^1-regularization if the sparsity assumption fails
- Convergence rates in \(\ell^{1}\)-regularization when the basis is not smooth enough
- Convergence rates of convex variational regularization
- Convex Tikhonov regularization in Banach spaces: new results on convergence rates
- Direct and inverse results in variable Hilbert scales
- Elastic-net regularization versus ℓ 1 -regularization for linear inverse problems with quasi-sparse solutions
- Elastic-net regularization: error estimates and active set methods
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- Generalized Bregman distances and convergence rates for non-convex regularization methods
- Generalized Tikhonov regularization and modern convergence rate theory in Banach spaces
- Handbook of Mathematical Methods in Imaging
- Modulus of continuity for conditionally stable ill-posed problems in Hilbert space
- Multi-parameter Tikhonov regularization with the ^0 sparsity constraint
- Non-convex sparse regularisation
- On the interplay of basis smoothness and specific range conditions occurring in sparsity regularization
- On the interplay of source conditions and variational inequalities for nonlinear ill-posed problems
- One new strategy for a priori choice of regularizing parameters in Tikhonov's regularization
- Parameter choice in Banach space regularization under variational inequalities
- Regularization and Variable Selection Via the Elastic Net
- Regularization methods in Banach spaces.
- Regularization of ill-posed problems in Banach spaces: convergence rates
- Regularization properties of the sequential discrepancy principle for Tikhonov regularization in Banach spaces
- Regularization properties of Tikhonov regularization with sparsity constraints
- Regularization with non-convex separable constraints
- Sparse and stable Markowitz portfolios
- Sparse recovery in inverse problems
- Sparse regularization with l q penalty term
- Statistical and computational inverse problems.
- The index function and Tikhonov regularization for ill-posed problems
- Variational methods in imaging
- Variational smoothness assumptions in convergence rate theory -- an overview
- Well-posedness and convergence rates for sparse regularization with sublinear \(l^q\) penalty term
Cited in
(17)- Sparse recovery by the standard Tikhonov method
- Proximal algorithm for minimization problems in \(l_0\)-regularization for nonlinear inverse problems
- Morozov's discrepancy principle for _1-_2 sparsity regularization
- The least error method for sparse solution reconstruction
- Multi-parameter Tikhonov regularization with the ^0 sparsity constraint
- Elastic-net regularization versus ℓ 1 -regularization for linear inverse problems with quasi-sparse solutions
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Sparse regularization with l q penalty term
- Well-posedness classes for sparse regularization
- Variational source conditions in \(L^p\)-spaces
- \(\alpha\ell_1-\beta\ell_2\) regularization for sparse recovery
- Sparse regularization with the ℓ0 norm
- _1 - _2 sparsity regularization for nonlinear ill-posed problems
- Error estimates and converse results for a class of linear regularization methods for inverse problems in Banach spaces
- Sparse variational regularization with oversmoothing penalty term in the scale of sequence spaces
- Regularization properties of Tikhonov regularization with sparsity constraints
- Non-convex sparse regularisation
This page was built for publication: Tikhonov regularization with \({\ell^{0}}\)-term complementing a convex penalty: \({\ell^{1}}\)-convergence under sparsity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2316708)
