A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
The subject of this paper is a class of a posteriori parameter choice strategies for Tikhonov's method to regularize linear ill-posed problems in Hilbert spaces. The considered class includes well-known rules like the discrepancy principle, a modified discrepancy principle and the monotone error rule. Under- and overestimated noise levels are also covered. We give some details, and for this purpose consider an operator equation \( A u = f \), where \( A: H \to F \) is a bounded linear operator between Hilbert spaces \( H \) and \( F \). In addition, \( f \) is supposed to belong to the range of \( A \) which may be non-closed, in general. For the stable solution of \( Au=f \), Tikhonov regularization \( u_\alpha = (\alpha I + A^* A)^{-1} A^* \tilde{f}, \, \alpha > 0 \), is considered, where \( A^*: F \to H \) denotes the adjoint of the operator \( A \), and \( \tilde{f} \in F \) is an approximation to the right-hand side \( f \). The considered parameter choice rule is of the form \[ d(\alpha,q,k,s) := \frac{\kappa_\alpha^{2k+s_0-s} \| D_\alpha^k B_\alpha (Au_\alpha - \tilde{f}) \|^2} {\| D_\alpha^{sq/2} B_\alpha^{2q-2} (Au_\alpha - \tilde{f}) \|^{2/q}} = b \delta^{2-2/q}, \tag{\(*\)} \] where \( q, k, s \) and \( b \) are some parameters, with \( s \geq 0, \, k \geq s/2 \), and \( b \) is sufficiently large. In addition, \( \delta > 0 \) represents some noise level for the right-hand side of \( Au= f\), and this noise level may be under- or overestimated, in general. Moreover we have \( \kappa_\alpha = 1 + \alpha \| A \|^{-2}, \, B_\alpha = \sqrt{\alpha}(\alpha I + A A^*)^{-1/2} \) and \( D_\alpha = \alpha^{-1} AA^* B_\alpha^2 \;(\alpha > 0) \). Finally, there holds \( s_0 = 0 \) if \( 2k = s \), and \( s_0 = 1 \) otherwise. In the course of this paper, the special case \( q = 3/2 \) is considered in more detail. For this setting, the following three results are presented: a) if \( \alpha=\alpha(\delta) \) is the smallest solution of equation \( (*) \) and \( \| \tilde{f} - f \| \leq \delta \) holds, then \( \| u_{\alpha(\delta)} - u_* \| \to 0 \) as \( \delta \to 0 \), where \( u_* \in H \) denotes the minimum norm solution of the equation \( Au=f \); b) if \( \alpha=\alpha(\delta) \) is the largest solution of equation \( (*) \) and \( \| \tilde{f} - f \| \leq c_* \delta \) holds for some constant \( c_* \), then \( \| u_{\alpha(\delta)} - u_* \| \to 0 \) as \( \delta \to 0 \); c) if \( \alpha=\alpha(\delta) \) is the smallest solution of equation \( (*) \), and if in addition \( \alpha(\delta)\) can be bounded from above by some constant specified in the paper, then in the case \( \| \tilde{f} - f \| \leq \delta \) the order optimal estimate \( \| u_{\alpha(\delta)} - u_* \| \leq C\inf_{\alpha>0} \{ \| u_{\alpha}^+ - u_* \| + \tfrac{\delta}{2\sqrt{\alpha}} \} \) holds. Here the notation \( u_\alpha^+ = (\alpha I + A^* A)^{-1} A^* f, \, \alpha > 0 \), is used, and \( C \) is some positive constant. In b), \( k > s/2 \) is additionally required, and in c), \( k \leq 3s/4 \) is assumed. The paper concludes with the presentation of some numerical experiments.
- A family of rules for the choice of the regularization parameter in the Lavrentiev method in the case of rough estimate of the noise level of the data
- On minimization strategies for choice of the regularization parameter in ill-posed problems
- On the choice of the regularization parameter in ill-posed problems with approximately given noise level of data
- NEW RULE FOR CHOICE OF THE REGULARIZATION PARAMETER IN (ITERATED) TIKHONOV METHOD
- Comparison of parameter choices in regularization algorithms in case of different information about noise level
- A Lepskij-type stopping rule for regularized Newton methods
- About the balancing principle for choice of the regularization parameter
- An A Posteriori Parameter Choice for Ordinary and Iterated Tikhonov Regularization of Ill-Posed Problems Leading to Optimal Convergence Rates
- Comparing parameter choice methods for regularization of ill-posed problems
- Comparison of parameter choices in regularization algorithms in case of different information about noise level
- Error estimates for linear systems with applications to regularization
- Geometry of linear ill-posed problems in variable Hilbert scales
- scientific article; zbMATH DE number 3926106 (Why is no real title available?)
- scientific article; zbMATH DE number 3954180 (Why is no real title available?)
- scientific article; zbMATH DE number 3956335 (Why is no real title available?)
- scientific article; zbMATH DE number 618067 (Why is no real title available?)
- scientific article; zbMATH DE number 703537 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3298300 (Why is no real title available?)
- NEW RULE FOR CHOICE OF THE REGULARIZATION PARAMETER IN (ITERATED) TIKHONOV METHOD
- Numerical comparison of regularization algorithms for solving ill-posed problems
- On minimization strategies for choice of the regularization parameter in ill-posed problems
- ON NUMERICAL REALIZATION OF QUASIOPTIMAL PARAMETER CHOICES IN (ITERATED) TIKHONOV AND LAVRENTIEV REGULARIZATION
- On the choice of the regularization parameter in ill-posed problems with approximately given noise level of data
- On the quasioptimal regularization parameter choices for solving ill-posed problems
- Regularization of some linear ill-posed problems with discretized random noisy data
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- The Lepskii principle revisited
- The quasi-optimality criterion for classical inverse problems
- The use of monotonicity for choosing the regularization parameter in ill-posed problems
- Use of extrapolation in regularization methods
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
- Old and new parameter choice rules for discrete ill-posed problems
- Comparison of a-posteriori parameter choice rules for linear discrete ill-posed problems
- Applying Legendre wavelet method with Tikhonov regularization for one-dimensional time-fractional diffusion equations
- Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition
- Automatic parameter selection based on residual whiteness for convex non-convex variational restoration
- A simplified L-curve method as error estimator
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Discretization independent convergence rates for noise level-free parameter choice rules for the regularization of ill-conditioned problems
- On the choice of the Tikhonov regularization parameter and the discretization level: a discrepancy-based strategy
- Semi-heuristic parameter choice rules for Tikhonov regularisation with operator perturbations
- Choice of regularization parameter based on the regularized solution reconstruction in adaptive signal correction problem
- A coupled complex boundary method for the Cauchy problem
- A Variant of Projection-Regularization Method for Ill-Posed Linear Operator Equations
- On minimization strategies for choice of the regularization parameter in ill-posed problems
- Extrapolation of Tikhonov regularization method
- A fast solver for an inverse problem arising in bioluminescence tomography
- scientific article; zbMATH DE number 19462 (Why is no real title available?)
- A GCV based Arnoldi-Tikhonov regularization method
- On the quasi-optimal rules for the choice of the regularization parameter in case of a noisy operator
- Heuristic parameter choice in Tikhonov method from minimizers of the quasi-optimality function
- Adaptivity and oracle inequalities in linear statistical inverse problems: a (numerical) survey
- A homotopy method for bioluminescence tomography
- Block regularization Kaczmarz method
- A numerical method based on three-dimensional Legendre wavelet method for two-dimensional time-fractional diffusion equation
- Comparison of parameter choices in regularization algorithms in case of different information about noise level
- Heuristic Parameter Choice Rules for Tikhonov Regularization with Weakly Bounded Noise
- Monotonicity of error of regularized solution and its use for parameter choice
- A family of rules for the choice of the regularization parameter in the Lavrentiev method in the case of rough estimate of the noise level of the data
- A discretizing Tikhonov regularization method via modified parameter choice rules
- A class of a posteriori parameter choice rules for filter-based regularization schemes
This page was built for publication: A family of rules for parameter choice in Tikhonov regularization of ill-posed problems with inexact noise level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428129)