Embedded techniques for choosing the parameter in Tikhonov regularization.
From MaRDI portal
Abstract: This paper introduces a new strategy for setting the regularization parameter when solving large-scale discrete ill-posed linear problems by means of the Arnoldi-Tikhonov method. This new rule is essentially based on the discrepancy principle, although no initial knowledge of the norm of the error that affects the right-hand side is assumed; an increasingly more accurate approximation of this quantity is recovered during the Arnoldi algorithm. Some theoretical estimates are derived in order to motivate our approach. Many numerical experiments, performed on classical test problems as well as image deblurring are presented.
Recommendations
Cites work
- scientific article; zbMATH DE number 3980383 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- A Bidiagonalization-Regularization Procedure for Large Scale Discretizations of Ill-Posed Problems
- A GCV based Arnoldi-Tikhonov regularization method
- A Note on the Superlinear Convergence of GMRES
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- A new zero-finder for Tikhonov regularization
- A weighted-GCV method for Lanczos-hybrid regularization
- Adaptive Arnoldi-Tikhonov regularization for image restoration
- An iterative method for Tikhonov regularization with a general linear regularization operator
- Arnoldi-Tikhonov regularization methods
- Automatic parameter setting for Arnoldi-Tikhonov methods
- Choosing regularization parameters in iterative methods for ill-posed problems
- Comparing parameter choice methods for regularization of ill-posed problems
- Discrete ill-posed least-squares problems with a solution norm constraint
- Discrete inverse problems. Insight and algorithms.
- Near-optimal parameters for Tikhonov and other regularization methods
- Noise propagation in regularizing iterations for image deblurring
- Old and new parameter choice rules for discrete ill-posed problems
- On the regularizing properties of the GMRES method
- On the residual norm in FOM and GMRES
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- The discrete Picard condition for discrete ill-posed problems
- Tikhonov regularization and the L-curve for large discrete ill-posed problems
Cited in
(16)- Some properties of the Arnoldi-based methods for linear ill-posed problems
- Hybrid Projection Methods with Recycling for Inverse Problems
- Color image and video restoration using tensor CP decomposition
- Projected Newton method for noise constrained Tikhonov regularization
- Techniques for a priori choice of regularizing parameters in Tikhonov regularization
- A new framework for multi-parameter regularization
- Inheritance of the discrete Picard condition in Krylov subspace methods
- LAP: A linearize and project method for solving inverse problems with coupled variables
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- Near-optimal parameters for Tikhonov and other regularization methods
- Efficient estimation of regularization parameters via downsampling and the singular value expansion, downsampling regularization parameter estimation
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Hybrid projection methods with recycling for inverse problems
- Automatic parameter setting for Arnoldi-Tikhonov methods
- A solution method for compact linear operator equations based on the Arnoldi process
- Arnoldi decomposition, GMRES, and preconditioning for linear discrete ill-posed problems
This page was built for publication: Embedded techniques for choosing the parameter in Tikhonov regularization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948086)
