On Minimization Strategies for Choice of the Regularization Parameter in Ill-Posed Problems
DOI10.1080/01630560903392941zbMath1189.65123OpenAlexW2043730201MaRDI QIDQ3405614
Uno Hämarik, Reimo Palm, Toomas Raus
Publication date: 10 February 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630560903392941
ill-posed problemstopping ruleconjugate gradientsregularization parameterLandweber methodquasioptimality criterioniterated Tikhonov methodheuristic rulesiterated Lavrentiev method
Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the quasioptimality criterion for (iterated) Tikhonov regularization
- Error estimates for linear systems with applications to regularization
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- On the balancing principle for some problems of numerical analysis
- The discrepancy principle for a class of regularization methods
- Some considerations concerning regularization and parameter choice algorithms
- The convergence of a new heuristic parameter selection criterion for general regularization methods
- ON RULES FOR STOPPING THE CONJUGATE GRADIENT TYPE METHODS IN ILL‐POSED PROBLEMS
- Recent results on the quasi-optimality principle
- ON NUMERICAL REALIZATION OF QUASIOPTIMAL PARAMETER CHOICES IN (ITERATED) TIKHONOV AND LAVRENTIEV REGULARIZATION
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- An a posteriori parameter choice for ordinary and iterated Tikhonov regularization of ill-posed problems leading to optimal convergence rates
- Justification of the choice of regularization parameter according to quasi-optimality and quotient criteria
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Geometry of linear ill-posed problems in variable Hilbert scales
- The regularizing properties of the adjoint gradient method in ill-posed problems
- A General Heuristic for Choosing the Regularization Parameter in Ill-Posed Problems
- The use of monotonicity for choosing the regularization parameter in ill-posed problems
- NEW RULE FOR CHOICE OF THE REGULARIZATION PARAMETER IN (ITERATED) TIKHONOV METHOD
- On the quasioptimal regularization parameter choices for solving ill-posed problems
- Use of extrapolation in regularization methods
- On the Adaptive Selection of the Parameter in Regularization of Ill-Posed Problems
- The Lepskii principle revisited
This page was built for publication: On Minimization Strategies for Choice of the Regularization Parameter in Ill-Posed Problems