A stopping criterion for iterative regularization methods
From MaRDI portal
Publication:284928
DOI10.1016/J.APNUM.2016.03.006zbMATH Open1382.65115OpenAlexW2303004438MaRDI QIDQ284928FDOQ284928
Authors: G. Landi, I. Tomba, E. Loli Piccolomini 
Publication date: 18 May 2016
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11585/589928
Recommendations
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- Monotonicity of error and choice of the stopping index in iterative regularization methods
- ON RULES FOR STOPPING THE CONJUGATE GRADIENT TYPE METHODS IN ILL‐POSED PROBLEMS
- Stopping rules for iterative methods in nonnegatively constrained deconvolution
iterative regularizationCGLSdiscrete Picard conditionlinear discrete ill-posed problemsregularization parameter choice
Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical solutions to equations with linear operators (65J10)
Cites Work
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Error estimates for linear systems with applications to regularization
- Error estimates for the regularization of least squares problems
- Regularization parameter determination for discrete ill-posed problems
- Title not available (Why is that?)
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Title not available (Why is that?)
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Title not available (Why is that?)
- Comparing parameter choice methods for regularization of ill-posed problems
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Old and new parameter choice rules for discrete ill-posed problems
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Deblurring Images
- Title not available (Why is that?)
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- Nonnegative least-squares image deblurring: improved gradient projection approaches
- Noise propagation in regularizing iterations for image deblurring
- GMRES-type methods for inconsistent systems
- GMRES, L-curves, and discrete ill-posed problems
- On the regularizing properties of the GMRES method
- Limitations of the \(L\)-curve method in ill-posed problems
- Data based regularization for discrete deconvolution problems
- Exploiting residual information in the parameter choice for discrete ill-posed problems
- 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
- On minimization strategies for choice of the regularization parameter in ill-posed problems
- Residual periodograms for choosing regularization parameters for ill-posed problems
- The convergence of a new heuristic parameter selection criterion for general regularization methods
- Title not available (Why is that?)
- Recent results on the quasi-optimality principle
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- Title not available (Why is that?)
- Title not available (Why is that?)
- Superoptimal Preconditioned Conjugate Gradient Iteration for Image Deblurring
- Non-convergence of the L-curve regularization parameter selection method
- A Regularization Parameter in Discrete Ill-Posed Problems
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- Iterative Regularization and MINRES
- Discrete inverse problems. Insight and algorithms.
- Quasi-Newton projection methods and the discrepancy principle in image restoration
- The discrete Picard condition for discrete ill-posed problems
- Iterative regularization with minimum-residual methods
- A new \(L\)-curve for ill-posed problems
- A projected Newton-CG method for nonnegative astronomical image deblurring
- On the convergence of the quasioptimality criterion for (iterated) Tikhonov regularization
Cited In (11)
- The Steklov-Poincaré technique for data completion: preconditioning and filtering
- New approach to the iterative method for numerical solution of a convolution type equation determined for a certain class of problems
- A study of a posteriori stopping in iteratively regularized Gauss-Newton-type methods for approximating quasi-solutions of irregular operator equations
- Stopping rules for iterative methods in nonnegatively constrained deconvolution
- Title not available (Why is that?)
- On unifying randomized methods for inverse problems
- Implicit iterative schemes based on singular decomposition and regularizing algorithms
- Stopping criteria for linesearch methods without derivatives
- Automatic stopping rule for iterative methods in discrete ill-posed problems
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- A comparison of regularization models for few-view CT image reconstruction
Uses Software
This page was built for publication: A stopping criterion for iterative regularization methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q284928)
