Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
From MaRDI portal
Publication:2355574
The author proposes a fixed-point-type derivative-free algorithm for computing the regularization parameter chosen by the generalized discrepancy principle (GDP). He proves that the algorithm is globally and monotonically convergent and has convergence properties that do not depend on additional parameters, as required by other algorithms from the literature. Numerical experiments are presented on an inverse scattering problem.
Recommendations
- Iterative parameter choice by discrepancy principle
- An improved fixed-point algorithm for determining a Tikhonov regularization parameter
- Fast realization algorithms for determining regularization parameters in linear inverse problems
- A discrepancy-based parameter adaptation and stopping rule for minimization algorithms aiming at Tikhonov-type regularization
- A parameter choice method for Tikhonov regularization
Cites work
- A bidiagonalization algorithm for solving large and sparse ill-posed systems of linear equations
- A maximum product criterion as a Tikhonov parameter choice rule for Kirsch's factorization method
- A simple method using Morozov's discrepancy principle for solving inverse scattering problems
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- A weighted-GCV method for Lanczos-hybrid regularization
- An iterative method for Tikhonov regularization with a general linear regularization operator
- Characterization of the shape of a scattering obstacle using the spectral data of the far field operator
- Efficient Algorithms for Solution of Regularized Total Least Squares
- Extension of GKB-FP algorithm to large-scale general-form Tikhonov regularization.
- Fixed-point iterations in determining a Tikhonov regularization parameter in Kirsch's factorization method
- Fixed-point iterations in determining the Tikhonov regularization parameter
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- scientific article; zbMATH DE number 3876486 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Inverse acoustic and electromagnetic scattering theory
- Large-scale Tikhonov regularization of total least squares
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Moment theory and some inverse problems in potential theory and heat conduction
- On the generalized discrepancy principle for Tikhonov regularization in Hilbert scales
- Overview of total least-squares methods
- Rank-Deficient and Discrete Ill-Posed Problems
- Regularization of linear ill-posed problems with noisy right hand side and noisy operator
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Regularized total least squares based on quadratic eigenvalue problem solvers
- Regularized Total Least Squares: Computational Aspects and Error Bounds
- Simple square smoothing regularization operators
- Tikhonov Regularization and Total Least Squares
- Two notes on the choice of regularization parameter
Cited in
(10)- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- A numerical comparison of different qualitative algorithms for solving 2D inverse elastic scattering problems
- Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
- A Tikhonov regularized penalty function approach for solving polylinear programming problems
- Galerkin approach for estimating boundary data in Poisson equation on annular domain with application to heat transfer coefficient estimation in coiled tubes
- A numerical reconstruction method in inverse elastic scattering
- Sampling method based projection approach for the reconstruction of 3D acoustically penetrable scatterers
- Analysis of the discrepancy principle for Tikhonov regularization with oversmoothing penalty term under low order source conditions
- Rapid generalized Schultz iterative methods for the computation of outer inverses
- A new zero-finder for Tikhonov regularization
This page was built for publication: Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355574)
