Regularization parameter determination for discrete ill-posed problems
From MaRDI portal
Publication:2510005
DOI10.1016/j.cam.2014.06.004zbMath1295.65046OpenAlexW2026060889MaRDI QIDQ2510005
Michiel E. Hochstenbach, Giuseppe Rodriguez, Lothar Reichel
Publication date: 31 July 2014
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2014.06.004
regularizationTikhonov regularizationill-posed problemtruncated singular value decompositionleast squares problemslarge-scale problemsheuristic parameter choice rulenoise level estimation
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Related Items
A stopping criterion for iterative regularization methods ⋮ Parameter determination for Tikhonov regularization problems in general form ⋮ Heuristic Parameter Choice in Tikhonov Method from Minimizers of the Quasi-Optimality Function ⋮ Scattered data fitting by minimal surface ⋮ Choice of regularization parameter based on the regularized solution reconstruction in adaptive signal correction problem ⋮ Parameter-free restoration of piecewise smooth images ⋮ The minimal-norm Gauss-Newton method and some of its regularized variants ⋮ Inversion of multiconfiguration complex EMI data with minimum gradient support regularization: a case study ⋮ Recovering the electrical conductivity of the soil via a linear integral model ⋮ Residual whiteness principle for parameter-free image restoration ⋮ Identification of random dynamic force using an improved maximum entropy regularization combined with a novel conjugate gradient ⋮ Sparse approximation of fitting surface by elastic net ⋮ A new iterative method for a class of linear system arising from image restoration problems ⋮ cosereg ⋮ Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration ⋮ FDEMtools: a Matlab package for FDEM data inversion ⋮ Simple stopping criteria for the LSQR method applied to discrete ill-posed problems ⋮ Application of the Newton iteration algorithm to the parameter estimation for dynamical systems ⋮ A new heuristic parameter choice rule in Tikhonov regularization applied for Ritz approximation of an ill-posed problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- \texttt{smt}: A Matlab toolbox for structured matrices
- Comparing parameter choice methods for regularization of ill-posed problems
- A new \(L\)-curve for ill-posed problems
- Error estimates for the regularization of least squares problems
- Error estimates for large-scale ill-posed problems
- The prolate matrix
- GMRES, L-curves, and discrete ill-posed problems
- Deconvolution and regularization with Toeplitz matrices
- The triangle method for finding the corner of the L-curve
- Old and new parameter choice rules for discrete ill-posed problems
- Estimation of the \(L\)-curve via Lanczos bidiagonalization
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Regularization tools version \(4.0\) for matlab \(7.3\)
- An adaptive pruning algorithm for the discrete L-curve criterion
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Pitfalls in the Numerical Solution of Linear Ill-Posed Problems
- Computational Methods for Integral Equations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The Use of Auto-correlation for Pseudo-rank Determination in Noisy III-conditioned Linear Least-squares Problems
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- A Regularization Parameter in Discrete Ill-Posed Problems
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
