scholarly journals Penalty-based smoothness conditions in convex variational regularization

2019 ◽  
Vol 27 (2) ◽  
pp. 283-300 ◽  
Author(s):  
Bernd Hofmann ◽  
Stefan Kindermann ◽  
Peter Mathé
Keyword(s):  
Banach Space ◽  
Variational Inequalities ◽  
Tikhonov Regularization ◽  
Hilbert Spaces ◽  
Noise Level ◽  
Regularization Parameter ◽  
The Family ◽  
Ill Posed ◽  
General Convex ◽  
Variational Regularization

Abstract The authors study Tikhonov regularization of linear ill-posed problems with a general convex penalty defined on a Banach space. It is well known that the error analysis requires smoothness assumptions. Here such assumptions are given in form of inequalities involving only the family of noise-free minimizers along the regularization parameter and the (unknown) penalty-minimizing solution. These inequalities control, respectively, the defect of the penalty, or likewise, the defect of the whole Tikhonov functional. The main results provide error bounds for a Bregman distance, which split into two summands: the first smoothness-dependent term does not depend on the noise level, whereas the second term includes the noise level. This resembles the situation of standard quadratic Tikhonov regularization in Hilbert spaces. It is shown that variational inequalities, as these were studied recently, imply the validity of the assumptions made here. Several examples highlight the results in specific applications.

scholarly journals ON NUMERICAL REALIZATION OF QUASIOPTIMAL PARAMETER CHOICES IN (ITERATED) TIKHONOV AND LAVRENTIEV REGULARIZATION

2009 ◽  
Vol 14 (1) ◽  
pp. 99-108 ◽  
Author(s):  
Toomas Raus ◽  
Uno Hämarik
Keyword(s):  
Hilbert Spaces ◽  
Noise Level ◽  
Regularization Parameter ◽  
Numerical Realization ◽  
A Posteriori ◽  
Parameter Choice ◽  
Linear Combinations ◽  
Choice Alternative ◽  
Lavrentiev Regularization ◽  
Ill Posed

We consider linear ill‐posed problems in Hilbert spaces with noisy right hand side and given noise level. For approximation of the solution the Tikhonov method or the iterated variant of this method may be used. In self‐adjoint problems the Lavrentiev method or its iterated variant are used. For a posteriori choice of the regularization parameter often quasioptimal rules are used which require computing of additionally iterated approximations. In this paper we propose for parameter choice alternative numerical schemes, using instead of additional iterations linear combinations of approximations with different parameters.

On The Analog Of The Monotone Error Rule For Parameter Choice In The (Iterated) Lavrentiev Regularization

2008 ◽  
Vol 8 (3) ◽  
pp. 237-252 ◽  
Author(s):  
U HAMARIK ◽  
R. PALM ◽  
T. RAUS
Keyword(s):  
Hilbert Spaces ◽  
Noise Level ◽  
Regularization Parameter ◽  
Optimal Error Estimates ◽  
Discrepancy Principle ◽  
Parameter Choice ◽  
Optimal Error ◽  
Numerical Examples ◽  
Lavrentiev Regularization ◽  
Ill Posed

AbstractWe consider linear ill-posed problems in Hilbert spaces with a noisy right hand side and a given noise level. To solve non-self-adjoint problems by the (it-erated) Tikhonov method, one effective rule for choosing the regularization parameter is the monotone error rule (Tautenhahn and Hamarik, Inverse Problems, 1999, 15, 1487– 1505). In this paper we consider the solution of self-adjoint problems by the (iterated) Lavrentiev method and propose for parameter choice an analog of the monotone error rule. We prove under certain mild assumptions the quasi-optimality of the proposed rule guaranteeing convergence and order optimal error estimates. Numerical examples show for the proposed rule and its modifications much better performance than for the modified discrepancy principle.

A fast multilevel iteration method for solving linear ill-posed integral equations

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Hongqi Yang ◽  
Rong Zhang
Keyword(s):  
Approximate Solution ◽  
Linear System ◽  
Integral Equations ◽  
Tikhonov Regularization ◽  
Iteration Method ◽  
Noise Level ◽  
Regularization Parameter ◽  
Ill Posed ◽  
Linear Integral ◽  
Linear Integral Equations

Abstract We propose a new concept of noise level: R ⁢ ( K * ) \mathcal{R}(K^{*}) -noise level for ill-posed linear integral equations in Tikhonov regularization, which extends the range of regularization parameter. This noise level allows us to choose a more suitable regularization parameter. Moreover, we also analyze error estimates of the approximate solution with respect to this noise level. For ill-posed integral equations, finding fast and effective numerical methods is a challenging problem. For this, we formulate a matrix truncated strategy based on multiscale Galerkin method to generate the linear system of Tikhonov regularization for ill-posed linear integral equations, which greatly reduce the computational complexity. To further reduce the computational cost, a fast multilevel iteration method for solving the linear system is established. At the same time, we also prove convergence rates of the approximate solution obtained by this fast method with respect to the R ⁢ ( K * ) \mathcal{R}(K^{*}) -noise level under the balance principle. By numerical results, we show that R ⁢ ( K * ) \mathcal{R}(K^{*}) -noise level is very useful and the proposed method is a fast and effective method, respectively.

scholarly journals NEW RULE FOR CHOICE OF THE REGULARIZATION PARAMETER IN (ITERATED) TIKHONOV METHOD

2009 ◽  
Vol 14 (2) ◽  
pp. 187-198 ◽  
Author(s):  
Toomas Raus ◽  
Uno Hämarik
Keyword(s):  
Hilbert Spaces ◽  
Noise Level ◽  
Regularization Parameter ◽  
Optimal Error Estimates ◽  
A Posteriori ◽  
Optimal Error ◽  
Numerical Examples ◽  
Tikhonov Method ◽  
Mild Assumption ◽  
Ill Posed

We propose a new a posteriori rule for choosing the regularization parameter α in (iterated) Tikhonov method for solving linear ill‐posed problems in Hilbert spaces. We assume that data are noisy but noise level δ is given. We prove that (iterated) Tikhonov approximation with proposed choice of α converges to the solution as δ → 0 and has order optimal error estimates. Under certain mild assumption the quasioptimality of proposed rule is also proved. Numerical examples show the advantage of the new rule over the monotone error rule, especially in case of rough δ.

scholarly journals EXTRAPOLATION OF TIKHONOV REGULARIZATION METHOD

2010 ◽  
Vol 15 (1) ◽  
pp. 55-68 ◽  
Author(s):  
Uno Hämarik ◽  
Reimo Palm ◽  
Toomas Raus
Keyword(s):  
Approximate Solution ◽  
Tikhonov Regularization ◽  
Noise Level ◽  
Regularization Method ◽  
Regularization Parameter ◽  
Noisy Data ◽  
Tikhonov Regularization Method ◽  
Guaranteed Accuracy ◽  
Numerical Examples ◽  
Ill Posed

We consider regularization of linear ill‐posed problem Au = f with noisy data fδ, ¦fδ - f¦≤ δ . The approximate solution is computed as the extrapolated Tikhonov approximation, which is a linear combination of n ≥ 2 Tikhonov approximations with different parameters. If the solution u* belongs to R((A*A) n ), then the maximal guaranteed accuracy of Tikhonov approximation is O(δ 2/3) versus accuracy O(δ 2n/(2n+1)) of corresponding extrapolated approximation. We propose several rules for choice of the regularization parameter, some of these are also good in case of moderate over‐ and underestimation of the noise level. Numerical examples are given.

scholarly journals A modified Tikhonov regularization method based on Hermite expansion for solving the Cauchy problem of the Laplace equation

2020 ◽  
Vol 18 (1) ◽  
pp. 1685-1697
Author(s):  
Zhenyu Zhao ◽  
Lei You ◽  
Zehong Meng
Keyword(s):  
Cauchy Problem ◽  
Laplace Equation ◽  
Tikhonov Regularization ◽  
Regularization Method ◽  
Regularization Parameter ◽  
Solution Process ◽  
Tikhonov Regularization Method ◽  
Hermite Expansion ◽  
The Cauchy Problem ◽  
Ill Posed

Abstract In this paper, a Cauchy problem for the Laplace equation is considered. We develop a modified Tikhonov regularization method based on Hermite expansion to deal with the ill posed-ness of the problem. The regularization parameter is determined by a discrepancy principle. For various smoothness conditions, the solution process of the method is uniform and the convergence rate can be obtained self-adaptively. Numerical tests are also carried out to verify the effectiveness of the method.

The Regularization Method Based on Complex Collinearity Diagnostics and Metrics

2013 ◽  
Vol 416-417 ◽  
pp. 1393-1398
Author(s):  
Chao Zhong Ma ◽  
Yong Wei Gu ◽  
Ji Fu ◽  
Yuan Lu Du ◽  
Qing Ming Gui
Keyword(s):  
Tikhonov Regularization ◽  
Regularization Method ◽  
Regularization Parameter ◽  
Measurement Data ◽  
Tikhonov Regularization Method ◽  
Parameter Determination ◽  
Selection Methods ◽  
Ill Posed ◽  
Collinearity Diagnostics ◽  
Regularization Matrix

In a large number of measurement data processing, the ill-posed problem is widespread. For such problems, this paper introduces the solution of ill-posed problem of the unity of expression and Tikhonov regularization method, and then to re-collinearity diagnostics and metrics based on proposed based on complex collinearity diagnostics and the metric regularization method is given regularization matrix selection methods and regularization parameter determination formulas. Finally, it uses a simulation example to verify the effectiveness of the method.

Sign in / Sign up

Export Citation Format

Share Document