Abstract
We consider choice of the regularization parameter in Tikhonov method if the noise level of the data is unknown. One of the best rules for the heuristic parameter choice is the quasi-optimality criterion where the parameter is chosen as the global minimizer of the quasi-optimality function. In some problems this rule fails. We prove that one of the local minimizers of the quasi-optimality function is always a good regularization parameter. For the choice of the proper local minimizer we propose to construct the Q-curve which is the analogue of the L-curve, but on the x-axis we use modified discrepancy instead of discrepancy and on the y-axis the quasi-optimality function instead of the norm of the approximate solution. In the area rule we choose for the regularization parameter such local minimizer of the quasi-optimality function for which the area of the polygon, connecting on Q-curve this minimum point with certain maximum points, is maximal. We also provide a posteriori error estimates of the approximate solution, which allows to check the reliability of the parameter chosen heuristically. Numerical experiments on an extensive set of test problems confirm that the proposed rules give much better results than previous heuristic rules. Results of proposed rules are comparable with results of the discrepancy principle and the monotone error rule, if the last two rules use the exact noise level.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference40 articles.
1. Regularization of Inverse Problems, Volume 375 of Mathematics and Its Applications;Engl,1996
2. Iteration Procedures in Ill- Posed Problems;Vainikko,1986
3. The quasi-optimality criterion for classical inverse problems
4. On Minimization Strategies for Choice of the Regularization Parameter in Ill-Posed Problems
5. Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems;Kindermann;Electron. Trans. Numer. Anal.,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献