Choosing regularization parameters in iterative methods for ill-posed problems
From MaRDI portal
A common framework is presented for efficient algorithms that regularize after the application of a Krylov subspace method to project the problem into much smaller dimensional space, rather than before it. It is shown that the new algorithm often involves less computational costs. The approximate equivalence of this approach to other forms of regularization is examined, and numerical examples are presented.
Recommendations
- A new framework for multi-parameter regularization
- scientific article; zbMATH DE number 4026694
- Regularization of ill-posed problems: Optimal parameter choice in finite dimensions
- Automatic parameter setting for Arnoldi-Tikhonov methods
- On the choice of the regularization parameter for iterated Tikhonov regularization of ill-posed problems
Cited in
(94)- Robust constrained receding-horizon predictive control via bounded data uncertainties
- Arnoldi-Tikhonov regularization methods
- A statistical view of iterative methods for linear inverse problems
- Regularization of ill-posed problems: Optimal parameter choice in finite dimensions
- Some results on the regularization of LSQR for large-scale discrete ill-posed problems
- Comparing different types of approximators for choosing the parameters in the regularization of ill-posed problems
- An efficient method to set up a Lanczos based preconditioner for discrete ill-posed problems
- A dynamical Tikhonov regularization for solving ill-posed linear algebraic systems
- A regularised estimator for long-range dependent processes
- GKB-FP: An algorithm for large-scale discrete ill-posed problems
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- An analysis on the shear modulus of the modified Jeffreys model
- Iterative hybrid regularization for extremely noisy full models in single particle analysis
- Alternating step size method for solving ill-posed linear operator equations in energetic space
- Effective new methods for automated parameter selection in regularized inverse problems
- Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
- 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
- On the transmission eigenvalue problem for the acoustic equation with a negative index of refraction and a practical numerical reconstruction method
- Weighted conjugate gradient-type methods for solving quadrature discretization of Fredholm integral equations of the first kind
- Regularization parameter estimation for large-scale Tikhonov regularization using a priori information
- Exploiting residual information in the parameter choice for discrete ill-posed problems
- Optimal regularized low rank inverse approximation
- Regularized total least squares based on quadratic eigenvalue problem solvers
- A method for structured linear total least norm on blind deconvolution problem
- The regularizing effect of the Golub-Kahan iterative bidiagonalization and revealing the noise level in the data
- Optimal Kronecker product approximation of block Toeplitz matrices
- Large-Scale Inverse Problems in Imaging
- A stopping criterion for iterative regularization methods
- Embedded techniques for choosing the parameter in Tikhonov regularization.
- Hybrid and iteratively reweighted regularization by unbiased predictive risk and weighted GCV for projected systems
- A stopping rule for the conjugate gradient regularization method applied to inverse problems in acoustics
- Inheritance of the discrete Picard condition in Krylov subspace methods
- A new framework for multi-parameter regularization
- Regularized restoration for two dimensional band-limited signals
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- THE IDENTIFICATION OF COMPLEX SPATIOTEMPORAL PATTERNS USING COUPLED MAP LATTICE MODELS
- Determination of dynamic load distributions applied to Kirchhoff plates based on FEM and numerical Laplace transformation method
- Improved compressed sensing-based algorithm for sparse-view CT image reconstruction
- A GCV based Arnoldi-Tikhonov regularization method
- scientific article; zbMATH DE number 558379 (Why is no real title available?)
- Efficient generalized Golub-Kahan based methods for dynamic inverse problems
- Superresolution reconstruction using nonlinear gradient-based regularization
- Adaptive choice of the Tikhonov regularization parameter to solve ill-posed linear algebraic equations via Liapunov optimizing control
- Multisplitting for regularized least squares with Krylov subspace recycling.
- Sampled Tikhonov regularization for large linear inverse problems
- Hybrid projection methods with recycling for inverse problems
- Relaxed regularization for linear inverse problems
- Subspace Recycling--Based Regularization Methods
- Global convergence of stochastic gradient Hamiltonian Monte Carlo for nonconvex stochastic optimization: nonasymptotic performance bounds and momentum-based acceleration
- Infinite GMRES for parameterized linear systems
- An inner-outer iterative method for edge preservation in image restoration and reconstruction
- Krylov methods for low-rank regularization
- Iteratively reweighted FGMRES and FLSQR for sparse reconstruction
- Hybrid Projection Methods with Recycling for Inverse Problems
- Relaxed regularization for linear inverse problems
- Projection regularization algorithm for solving linear algebraic system of large dimension
- Flexible Krylov methods for \(\ell_p\) regularization
- A framework for regularization via operator approximation
- Greedy Tikhonov regularization for large linear ill-posed problems
- Generalized Hybrid Iterative Methods for Large-Scale Bayesian Inverse Problems
- Comparing parameter choice methods for regularization of ill-posed problems
- A descent method for regularization of ill-posed problems
- A regularized sampling algorithm for reconstructing non-bandlimited signals
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions
- An iterative Lagrange method for the regularization of discrete ill-posed inverse problems
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- Preconditioned Chebyshev BiCG method for parameterized linear systems
- Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
- A preconditioned Krylov subspace method for linear inverse problems with general-form Tikhonov regularization
- Multigrid preconditioning for regularized least-squares problems
- The regularized global GMERR method for solving large-scale linear discrete ill-posed problems
- A fast iterative regularization method for ill-posed problems
- Generalizing the SVD of a matrix under nonstandard inner product and its applications to linear ill-posed problems
- The regularized block GMERR method and its simpler version for solving large-scale linear discrete ill-posed problems
- The Tikhonov regularization method in elastoplasticity
- H-CMRH: an inner product free hybrid Krylov method for large-scale inverse problems
- Hybrid CG-Tikhonov is a filtration of the CG Lanczos vectors
- Schultz matrix iteration based method for stable solution of discrete ill-posed problems
- Solution of 3D inverse scattering problems by combined inverse equivalent current and finite element methods
- Subspace projection regularization for large-scale Bayesian linear inverse problems
- Scalable iterative data-adaptive RKHS regularization
- Fast flexible LSQR with a hybrid variant for efficient large-scale regularization
- Regularized dynamical parametric approximation
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- A hybrid sensitivity function and Lanczos bidiagonalization-Tikhonov method for structural model updating: application to a full-scale bridge structure
- Space-varying iterative restoration of diffuse optical tomograms reconstructed by the photon average trajectories method
- Total least-squares regularization of Tykhonov type and an ancient racetrack in Corinth
- An improved preconditioned LSQR for discrete ill-posed problems
- A parameter estimation method for model analysis
- A fast truncated Lagrange method for large-scale image restoration problems
- The Lagrange method for the regularization of discrete ill-posed problems
- Lanczos based preconditioner for discrete ill-posed problems
- UPRE method for total variation parameter selection
This page was built for publication: Choosing regularization parameters in iterative methods for ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2719194)
