#### Document Type

Article

#### Publication Date

8-30-2018

#### Abstract

Multiplicative regularization solves a linear inverse problem by minimizing the product of the norm of the data misfit and the norm of the solution. This technique is related to Tikhonov regularization with the parameter chosen to make the data misfit and regularization terms (of the Tikhonov objective function) equal. This suggests a heuristic parameter choice method, equivalent to the rule previously proposed by Reginska. Reginska's rule is well defined provided the data is sufficiently close to exact data and does not lie in the range of the operator. If a sufficiently large portion of the data error lies outside the range of the operator, then the solution defined by Reginska's rule converges weakly to the exact solution as the data error converges to zero. The regularization parameter converges to zero like the square of the norm of the data noise, leading to under-regularization for small noise levels. Nevertheless, the method performs well on a suite of test problems, as shown by comparison with the L-curve, generalized cross-validation, quasi-optimality, and Hanke--Raus parameter choice methods. A modification of the approach yields a heuristic parameter choice rule that is provably convergent (in the norm topology) under the restrictions on the data error described above, as long as the exact solution has a small amount of additional smoothness. On the test problems considered here, the modified rule outperforms all of the above heuristic methods, although it is only slightly better than the quasi-optimality rule.

#### Publication Title

SIAM Journal on Scientific Computing

#### Recommended Citation

Gockenbach, M.,
&
Gorgin, E.
(2018).
On the convergence of a heuristic parameter choice rule for Tikhonov regularization.
*
SIAM Journal on Scientific Computing,
40*(4), A2694-A2719.
http://dx.doi.org/10.1137/17M1138698

Retrieved from: https://digitalcommons.mtu.edu/math-fp/10

#### Version

Publisher's PDF

## Publisher's Statement

© 2018, Society for Industrial and Applied Mathematics. Article deposited here in compliance with publisher policy. Publisher's version of record: https://epubs.siam.org/doi/10.1137/17M1138698