Asymptotic behaviour of the minimum bound method for choosing the regularization parameter
DOI10.1088/0266-5611/14/1/013zbMATH Open0906.65055OpenAlexW2010008624MaRDI QIDQ4381827FDOQ4381827
Authors: Mark A. Lukas 
Publication date: 14 February 1999
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: http://researchrepository.murdoch.edu.au/id/eprint/15200/
Recommendations
- Comparisons of parameter choice methods for regularization with discrete noisy data
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- A generalization of Arcangeli's method for ill-posed problems leading to optimal rates
- scientific article; zbMATH DE number 703537
- Heuristic Parameter Choice Rules for Tikhonov Regularization with Weakly Bounded Noise
- On the optimality of regularization methods for solving linear ill-posed problems
- An a posteriori parameter choice for simplified regularization of ill- posed problems
- Semi-heuristic parameter choice rules for Tikhonov regularisation with operator perturbations
- The use of monotonicity for choosing the regularization parameter in ill-posed problems
- The discretized discrepancy principle under general source conditions
regularizationHilbert spaceoptimal rate of convergenceasymptotic behaviourSobolev spacestochastic frameworkparameter choice methodlinear ill-posed operator equationexpected squared error criterionminimum bound methodunbiased error method
Equations and inequalities involving linear operators, with vector unknowns (47A50) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical solutions to equations with linear operators (65J10)
Cited In (1)
This page was built for publication: Asymptotic behaviour of the minimum bound method for choosing the regularization parameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381827)
