Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches

DOI10.1002/gamm.202000017OpenAlexW3089371893MaRDI QIDQ6144045

Malena Sabaté Landman, Silvia Gazzola

Publication date: 5 January 2024

Published in: GAMM-Mitteilungen (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/gamm.202000017

zbMATH Keywords

Tikhonov regularizationKrylov subspace methodshybrid methodsregularization parameter choice rulesimaging problemslarge-scale linear inverse problems

Mathematics Subject Classification ID

Numerical linear algebra (65Fxx) Numerical methods for integral equations, integral transforms (65Rxx) Numerical analysis in abstract spaces (65Jxx)

Related Items (2)

Error estimates for Golub–Kahan bidiagonalization with Tikhonov regularization for ill–posed operator equations ⋮ Low-CP-rank tensor completion via practical regularization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inheritance of the discrete Picard condition in Krylov subspace methods
• A GCV based Arnoldi-Tikhonov regularization method
• Comparing parameter choice methods for regularization of ill-posed problems
• Invertible smoothing preconditioners for linear discrete ill-posed problems
• L-curve and curvature bounds for Tikhonov regularization
• Iterative methods for ill-posed problems. An introduction.
• On the reduction of Tikhonov minimization problems and the construction of regularization matrices
• The discrete Picard condition for discrete ill-posed problems
• A weighted-GCV method for Lanczos-hybrid regularization
• Simple square smoothing regularization operators
• Iterative regularization with minimum-residual methods
• A Golub-Kahan-type reduction method for matrix pairs
• Iterative regularization methods for nonlinear ill-posed problems
• Matrices, moments, and rational quadrature
• A new zero-finder for Tikhonov regularization
• A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
• Kronecker product and SVD approximations in image restoration
• Regularization methods for large-scale problems
• An implicit shift bidiagonalization algorithm for ill-posed systems
• GMRES-type methods for inconsistent systems
• Tikhonov regularization and the L-curve for large discrete ill-posed problems
• Regularization, GSVD and truncated GSVD
• A weighted pseudoinverse, generalized singular values, and constrained least squares problems
• Limitations of the \(L\)-curve method in ill-posed problems
• Old and new parameter choice rules for discrete ill-posed problems
• Estimation of the \(L\)-curve via Lanczos bidiagonalization
• Flexible GMRES for total variation regularization
• Approximation accuracy of the Krylov subspaces for linear discrete ill-posed problems
• On Krylov projection methods and Tikhonov regularization
• Automatic parameter setting for Arnoldi-Tikhonov methods
• On regularizing effects of MINRES and MR-II for large scale symmetric discrete ill-posed problems
• Noise representation in residuals of LSQR, LSMR, and CRAIG regularization
• IR tools: a MATLAB package of iterative regularization methods and large-scale test problems
• Regularization parameter estimation for large-scale Tikhonov regularization using a priori information
• Orthogonal projection regularization operators
• The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
• Choosing Regularization Parameters in Iterative Methods for Ill-Posed Problems
• GCV for Tikhonov regularization via global Golub–Kahan decomposition
• Square regularization matrices for large linear discrete ill-posed problems
• A Bilevel Optimization Approach for Parameter Learning in Variational Models
• The Anti-Reflective Transform and Regularization by Filtering
• Embedded techniques for choosing the parameter in Tikhonov regularization
• Hybrid and Iteratively Reweighted Regularization by Unbiased Predictive Risk and Weighted GCV for Projected Systems
• Windowed Spectral Regularization of Inverse Problems
• Deblurring Images
• Fixed-point iterations in determining the Tikhonov regularization parameter
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Regularization with Differential Operators: An Iterative Approach
• Solution of Sparse Indefinite Systems of Linear Equations
• Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
• Fast CG-Based Methods for Tikhonov--Phillips Regularization
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
• Separable nonlinear least squares: the variable projection method and its applications
• Non-convergence of the L-curve regularization parameter selection method
• Computational Methods for Inverse Problems
• A Regularization Parameter in Discrete Ill-Posed Problems
• Iterative Regularization and MINRES
• Flexible Krylov Methods for $\ell_p$ Regularization
• A Framework for Regularization via Operator Approximation
• Some Properties of the Arnoldi-Based Methods for Linear Ill-Posed Problems
• Discrete Inverse Problems
• A Projection‐Based Approach to General‐Form Tikhonov Regularization
• Smoothing‐Norm Preconditioning for Regularizing Minimum‐Residual Methods
• Covariance-Preconditioned Iterative Methods for Nonnegatively Constrained Astronomical Imaging
• A descent method for regularization of ill-posed problems
• Fast Nonnegative Least Squares Through Flexible Krylov Subspaces
• A stochastic estimator of the trace of the influence matrix for laplacian smoothing splines

This page was built for publication: Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches