Automatic stopping rule for iterative methods in discrete ill-posed problems
DOI10.1007/S40314-014-0174-3zbMATH Open1337.65034OpenAlexW2077994701MaRDI QIDQ747217FDOQ747217
Authors: Leonardo Borges, Fermín S. V. Bazán, M. C. C. Cunha 
Publication date: 23 October 2015
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40314-014-0174-3
Recommendations
- Stopping rules for solving nonlinear ill-posed problems
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- A stopping criterion for iterative regularization methods
- ON RULES FOR STOPPING THE CONJUGATE GRADIENT TYPE METHODS IN ILL‐POSED PROBLEMS
- An $\epsilon $-Free a Posteriori Stopping Rule for Certain Iterative Regularization Methods
regularizationpreconditioningstopping rulegeneralized minimal residual methodill-posed problemKrylov subspace methodprojection methodparameter choiceleast squares QR-methods
Preconditioners for iterative methods (65F08) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- An adaptive pruning algorithm for the discrete L-curve criterion
- Title not available (Why is that?)
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Rank-Deficient and Discrete Ill-Posed Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Methods of conjugate gradients for solving linear systems
- Regularization methods for large-scale problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing parameter choice methods for regularization of ill-posed problems
- Title not available (Why is that?)
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- 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
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Noise propagation in regularizing iterations for image deblurring
- GMRES-type methods for inconsistent systems
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Choosing regularization parameters in iterative methods for ill-posed problems
- Robust generalized cross-validation for choosing the regularization parameter
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- Implementations of range restricted iterative methods for linear discrete ill-posed problems
- A Regularization Parameter in Discrete Ill-Posed Problems
- Discrete inverse problems. Insight and algorithms.
- Smoothing‐Norm Preconditioning for Regularizing Minimum‐Residual Methods
- Invertible smoothing preconditioners for linear discrete ill-posed problems
- The discrete Picard condition for discrete ill-posed problems
- Iterative regularization with minimum-residual methods
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- Fixed-point iterations in determining the Tikhonov regularization parameter
- The triangle method for finding the corner of the L-curve
- An improved preconditioned LSQR for discrete ill-posed problems
- Title not available (Why is that?)
- Bounding the Subspaces from Rank Revealing Two-Sided Orthogonal Decompositions
Cited In (11)
- An iterative method to compute minimum norm solutions of ill-posed problems in Hilbert spaces
- A stopping rule for an iterative algorithm in systems of integral equations
- A stopping criterion for iterative regularization methods
- Inverse time-dependent source problem for the heat equation with a nonlocal Wentzell-Neumann boundary condition
- Double precision is not necessary for LSQR for solving discrete linear ill-posed problems
- Stopping Criteria for the Iterative Solution of Linear Least Squares Problems
- Simple stopping criteria for the LSQR method applied to discrete ill-posed problems
- Priorconditioned CGLS-based quasi-MAP estimate, statistical stopping rule, and ranking of priors
- A fast adaptive algorithm for nonlinear inverse problems with convex penalty
- Weighted conjugate gradient-type methods for solving quadrature discretization of Fredholm integral equations of the first kind
- Optimization methods for regularization-based ill-posed problems: a survey and a multi-objective framework
Uses Software
This page was built for publication: Automatic stopping rule for iterative methods in discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747217)
