Convergence of Heuristic Parameter Choice Rules for Convex Tikhonov Regularisation
arXiv:1905.06828 · doi:10.1137/19M1263066
Abstract
We investigate the convergence theory of several known as well as new heuristic parameter choice rules for convex Tikhonov regularisation. The success of such methods is dependent on whether certain restrictions on the noise are satisfied. In the linear theory, such conditions are well understood and hold for typically irregular noise. In this paper, we extend the convergence analysis of heuristic rules using noise restrictions to the convex setting and prove convergence of the aforementioned methods therewith. The convergence theory is exemplified for the case of an ill-posed problem with a diagonal forward operator in spaces. Numerical examples also provide further insight.
arXiv comment32 pages, 5 figures
References in corpus (5)
- Sparse Regularization with Penalty Term
- Heuristic parameter-choice rules for convex variational regularization based on error estimates
- Hanke-Raus heuristic rule for variational regularization in Banach spaces
- The quasi-optimality criterion in the linear functional strategy
- Heuristic Parameter Choice Rules for Tikhonov Regularisation with Weakly Bounded Noise