Case studies and a pitfall for nonlinear variational regularization under conditional stability
Daniel Gerth, Bernd Hofmann, Christopher Hofmann

TL;DR
This paper investigates the use of conditional stability estimates in nonlinear Tikhonov regularization, highlighting potential pitfalls and demonstrating convergence behavior through theoretical analysis and numerical case studies.
Contribution
It provides a detailed analysis of convergence and rates in nonlinear Tikhonov regularization under conditional stability, emphasizing the importance of correct stability estimates.
Findings
Oversmoothing penalties can achieve optimal convergence rates with modified assumptions.
Incorrect stability estimates can lead to failure of convergence.
Numerical examples illustrate potential pitfalls in applying conditional stability.
Abstract
Conditional stability estimates are a popular tool for the regularization of ill-posed problems. A drawback in particular under nonlinear operators is that additional regularization is needed for obtaining stable approximate solutions if the validity area of such estimates is not completely known. In this paper we consider Tikhonov regularization under conditional stability estimates for nonlinear ill-posed operator equations in Hilbert scales. We summarize assertions on convergence and convergence rate in three cases describing the relative smoothness of the penalty in the Tikhonov functional and of the exact solution. For oversmoothing penalties, for which the rue solution no longer attains a finite value, we present a result with modified assumptions for a priori choices of the regularization parameter yielding convergence rates of optimal order for noisy data. We strongly highlight…
| RS | est. | |||||
|---|---|---|---|---|---|---|
| 1 | 0.9578 | 0.3276 | 5.8483 | 2.7950 | 0.4871 | 2.6898 |
| 2 | 0.9017 | 0.3426 | 13.5714 | 2.8609 | 0.5212 | 2.6290 |
| 3 | 1.6102 | 0.4110 | 0.2782 | 2.3221 | 0.6978 | 2.3560 |
| 4 | 0.2571 | 0.2582 | 462.1747 | 2.7974 | 0.3481 | 2.9671 |
| 5 | 0.8868 | 0.6135 | 25.8986 | 1.9546 | 1.5875 | 1.5459 |
| s | ||||
|---|---|---|---|---|
| 0.1 | 0.9460 | 0.2647 | 86.90 | 1.8168 |
| 0.33 | 1.1492 | 0.2828 | 337.42 | 2.1324 |
| 0.9 | 1.2633 | 0.2919 | 250.08 | 2.5319 |
| 0.1 | 0.1275 | 0.2531 | 6.04e+02 | 1.6479 |
| 0.33 | 0.1228 | 0.2461 | 1.66e+03 | 1.8805 |
| 0.9 | 0.1229 | 0.2427 | 3.84e+04 | 2.5385 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNumerical methods in inverse problems · Thermoelastic and Magnetoelastic Phenomena · Probabilistic and Robust Engineering Design
11institutetext: Faculty of Mathematics, Chemnitz University of Technology, 09107 Chemnitz, Germany
11email: daniel.gerth/bernd.hofmann/christopher.[email protected]
Case studies and a pitfall for nonlinear variational regularization under
conditional stability
Daniel Gerth
Bernd Hofmann
Christopher Hofmann
Abstract
Conditional stability estimates are a popular tool for the regularization of ill-posed problems. A drawback in particular under nonlinear operators is that additional regularization is needed for obtaining stable approximate solutions if the validity area of such estimates is not completely known. In this paper we consider Tikhonov regularization under conditional stability estimates for nonlinear ill-posed operator equations in Hilbert scales. We summarize assertions on convergence and convergence rate in three cases describing the relative smoothness of the penalty in the Tikhonov functional and of the exact solution. For oversmoothing penalties, for which the rue solution no longer attains a finite value, we present a result with modified assumptions for a priori choices of the regularization parameter yielding convergence rates of optimal order for noisy data. We strongly highlight the local character of the conditional stability estimate and demonstrate that pitfalls may occur through incorrect stability estimates. Then convergence can completely fail and the stabilizing effect of conditional stability may be lost. Comprehensive numerical case studies for some nonlinear examples illustrate such effects.
MSC 2010: 47J06, 65J20, 47A52
keywords:
Nonlinear inverse problems, conditional stability, Tikhonov regularization, oversmoothing penalties, Hilbert scales, convergence rates
1 Introduction
Regularization theory for nonlinear ill-posed inverse problems is always a challenging endeavor. In contrast to linear inverse problems, where the theory is rather coherent and well-developed (see, for example, the monographs [10, 35]), the nonlinear theory is harder to grasp. Numerous assumptions exist in the literature that restrict the nonlinear behavior of the forward operator in such a way that stable approximate solutions exist which converge to the exact solution in the limit of vanishing data noise. It is important to keep in mind that the nonlinearity conditions only hold locally. A main goal of this paper is to show that this can be a pitfall, as incorrect localization leads to the loss of the stabilizing property. A second objective of the paper is to verify theoretical convergence results in numerical examples, as well as pointing out some open questions. To this end, we focus here on regularization in Hilbert scales. Going into detail, we consider in this paper the stable approximate solution of the nonlinear operator equation
[TABLE]
by variational (Tikhonov-type) regularization. Equation (1) serves as a model for an inverse problem where the nonlinear forward operator maps between the infinite dimensional real Hilbert spaces and with domain . The symbols and designate the norms and inner products of the spaces and , respectively. Instead of the exact right-hand side , with the uniquely determined preimage , we assume to know a noisy element satisfying the noise model
[TABLE]
with some noise level . Based on this data element we use as approximations to global minimizers of the extremal problem
[TABLE]
Here, is a densely defined, unbounded, linear, and self-adjoint operator which is strictly positive such that holds for all . Such operators generate a Hilbert scale , where coincides with the range of the operator . In particular , and we set for the norm of the Hilbert scale element . With this, the specific Tikhonov functional in (3) is the weighted sum of the quadratic misfit functional and the Hilbert-scale penalty functional , where the regularization parameter acts as weight factor. Note that no generality is lost by considering only the penalty in the -norm , since one can always rescale the operator to obtain for , i.e, one obtains a penalty of arbitrary index in the Hilbert scale generated by the operator . Finally, we mention that for we set if , and that the Tikhonov functional attains a well-defined value if .
A typical phenomenon of the nonlinear equation (1) as a model for an inverse problem is local ill-posedness at the solution point (cf. [27, Def. 2] or [26, Def. 3]), which means that inequalities of the form
[TABLE]
cannot hold for any positive constants and any index function .111Throughout, denotes a closed ball in the Hilbert space around with radius . Furthermore, we call a function index function if it is continuous, strictly increasing and satisfies the boundary condition . However, the inverse problem literature offers numerous examples, where the left-hand term in (4) is replaced with a weaker norm and a corresponding conditional stability estimate takes place. In the sequel, we restrict our considerations to the concave index functions of Hölder-type with exponents and hence to conditional stability estimates of the form
[TABLE]
with some index , which can be interpreted as degree of ill-posedness of at , a suitable subset in which acts as the aforementioned localization of the nonlinearity condition, and a constant that may depend on .
Let us consider the situation that and is known. Then one may employ a least squares iteration process of minimizing the norm square
[TABLE]
The minimizers of (6) satisfy by definition and due to . Hence we have convergence as of these least squares-type solutions to in the norm of the space which is weaker than the one in .
To achieve convergence and even convergence rates in the norm of , additional smoothness for some is needed. If the approximate solutions also possess such smoothness with uniformly bounded for all , then, with the interpolation inequality in Hilbert scales (see [33]) applies in the form
[TABLE]
for all . Hence we derive from (5) and (7) with and by the triangle inequality that
[TABLE]
for sufficiently small and some constant . A way to ensure the property that the approximate solutions belong to is to use regularized solutions which minimize the Tikhonov functional , subject to , where is required. Hence, Tikhonov-type regularization is here an auxiliary tool which complements the conditional stability estimate (5) in order to obtain stable approximate solutions measured in the norm of .
On the other hand, we have to take into account the frequently occurring situation that the set in (5) is not or not completely known and a minimization process according to (6) is impossible, because of a not completely known set of constraints for the optimization problem. Nevertheless, a combination of the conditional stability estimate (5) with variational regularization of the form (3) can be successful. For a systematic treatment of convergence results in the context of regularization theory we will distinguish the following cases relating the smoothness of the solution and of the approximate solutions implied by the functional (3):
Case distinction**.**
- (a)
Classical regularization: for , which means that and there is some source element such that ; 3. (b)
Matching smoothness: , i.e. , but for all . 4. (c)
Oversmoothing regularization: for some , but , i.e. .
The goal of this paper is to discuss the different opportunities and limitations for convergence and rates of regularized solutions in the situations (a), (b), and (c), respectively. It is organized as follows: Section 2 recalls assertions on convergence of regularized solutions in cases (a) and (b). Moreover, usual technical assumptions on forward operator, its domain and the exact solution are listed. In Section 3, Hölder rate results under conditional stability estimates are summarized for the cases of classical regularization and matching smoothness. The rate result of Proposition 3.7 for the oversmoothing case (c) is of specific interest. It requires two-sided inequalities as conditional stability estimates, whereas in cases (a) and (b) only one-sided inequalities are needed. Three inverse model problems of ill-posed nonlinear equations covering all cases (a), (b), and (c) are outlined in Section 4, for which numerical case studies are presented in Section 5. The proof of Proposition 3.7 is given in the appendix.
2 Convergence
In this section we collect properties of the regularized solutions obtained as solutions of the optimization problem (3) for the cases (a), (b), and (c) in different ways. Throughout this paper we suppose that the following assumption concerning the nonlinear forward operator and the solvability of the operator equation (1) holds true.
Assumption 1**.**
The operator is weak-to-weak sequentially continuous and its domain is a convex and closed subset of . For the right-hand side under consideration let be the uniquely determined solution to the operator equation (1).
Under the setting introduced in Section 1, the penalty as part of the Tikhonov functional in (3) is a non-negative, convex, and sequentially lower semi-continuous functional. Moreover, this functional is stabilizing in the sense that all its sublevel sets are weakly sequently compact in . Taking also into account Assumption 1, the Assumptions 3.11 and 3.22 of [45] are satisfied and the assertions from [45, Section 4.1.1] apply, which ensure existence and stability of the regularized solutions in our present Hilbert scale setting, consistent for all three cases (a), (b), and (c).
We emphasize at this point that we always have by definition of the minimizers in (3), but only in the cases (a) and (b) one can take profit of the inequality
[TABLE]
which implies for all that
[TABLE]
In the case (c), however, due to and hence we have no such uniform bounds of from above. On the contrary, in [13] it was shown that as is necessary even for weak convergence of the regularizers to .
In order to obtain convergence of the regularized solutions to as , the interplay of the noise level and the choice of the regularization parameter , which we choose either a priori or a posteriori , must be appropriate. In the literature, this interplay is typically controlled by the limit conditions
[TABLE]
In our case (a) this is a sufficient description.
Proposition 2.1**.**
Let the regularization parameter fulfill the conditions (10). Then we have under Assumption 1 and for case (a), i.e. for , by setting or , , that for as
[TABLE]
and
[TABLE]
Proof 2.2**.**
The proof follows along the lines of Theorem 4.3 and Corollary 4.6 from [45].
As we will see in Proposition 3.1 in the next section, the optimal parameter choice fulfills the conditions (10) in case (a). In case (b), where the smoothness of coincides with the smoothness of the regularization, i.e., , the matter becomes unclear. On one hand, it is easily seen that Proposition 2.1 holds in the exact same way for case (b), which is a consequence of (9) holding in both cases. Hence, we have the following corollary:
Corollary 2.3**.**
Under the assumptions of Proposition 2.1, in particular for the cases (a) and (b) and for a regularization parameter choice satisfying (10), we have that the regularized solutions belong to the ball for prescribed values and whenever is sufficiently small.
The surprising difference between the cases (a) and (b) on the other hand, is that the optimal choice of the regularization parameter for (b) (we show in Proposition 3.3 below that yields the optimal convergence rate) violates the second condition in (10). Since obviously a convergence rate implies norm convergence, this means that the condition in (10) is not necessary but sufficient for convergence, at least in case (b).
In case (c) with oversmoothing penalty, the inequality (8) and consequently (9) are missing. Results of Proposition 2.1 and Corollary 2.3 in general do not apply in that case. One cannot even show weak convergence in , and regularized solutions need not belong to a ball with small radius if is sufficiently small. As will be shown in Proposition 3.7 of Section 3 (see also [24, 25]), convergence rates can be proven under stronger conditions also for (c), where we have some such that . The key to these results was the appropriate choice of either by an a priori or a posteriori parameter choice. In particular, as , which violates (10), is typical there. The interplay of and will be in the focus of our numerical case studies in Section 5 below.
3 Convergence rate results
In this section, we are going to discuss convergence rate results for cases (a) and (b) on one hand, but also (c) on the other hand. In addition to Assumption 1 some versions of conditional stability estimates have to be imposed which, in combination with the smoothness assumptions , are essentially hidden forms of source conditions for the solution .
In Assumption 2 we first consider the situation for the setting . This model setting was comprehensively discussed and illustrated by examples of associated nonlinear inverse problems in the papers [8, 9, 24, 28]. Here we have evidently for the cases (a) and (b) whenever .
Assumption 2**.**
Let for fixed and the conditional stability estimates
[TABLE]
hold, where constants are supposed to exist for all radii .
Then the following proposition, which is a direct consequence of [9, Theorem 2.1] when adapting the corresponding proof, yields an order optimal convergence rate in case (a).
Proposition 3.1**.**
Under Assumptions 1 and 2 and for with we have the rate of convergence of regularized solutions to the solution as
[TABLE]
provided that the regularization parameter is chosen a priori as
[TABLE]
We easily see that the convergence results of Proposition 2.1 apply here for and that in particular (13) implies (10). The additional smoothness of , which is always required to obtain convergence rates in regularization of ill-posed problems appears in Hilbert scales in form with some source element .
Remark 3.2**.**
We mention that along the lines of [9, Theorem 2.2] the rate (12) can also be shown under the assumptions of Proposition 3.1 when the regularization parameter is chosen a posteriori by a sequential discrepancy principle.
The modified version of the rate result for case (b) is as follows:
Proposition 3.3**.**
Under the Assumptions 1 and 2 and for we have the rate of convergence of regularized solutions to the solution as
[TABLE]
if the regularization parameter is chosen a priori as
[TABLE]
Proof 3.4**.**
By the standard technique of variational regularization under conditional stability estimates (cf. [9, Proof of Theorem 1.1] or [45, Section 4.2.5]) we obtain for the choice (15) of the regularization parameter and by using the conditional stability estimate (11) the inequality
[TABLE]
where the constant via and depends on and on upper and lower bounds of . Combining this with the interpolation inequality (7), taking and , and applying the triangle inequality provides us with the estimate
[TABLE]
Due to (9) the norm is uniformly bounded by a finite constant for from (15). This yields the rate (14) and completes the proof. Finally, we should note that the inequality (16) can only be established, because constants in (11) exist for arbitrarily large .
In the borderline case (b) we have also a borderline a priori choice of the regularization parameter which contradicts the second limit condition in (10) such that the quotient is uniformly bounded below by a positive constant and above by a finite constant.
In Assumption 3 we consider alternatively the situation that . This model, which is illustrated by Example 1 in Section 4 below, is typical for conditional stability estimates that arise from nonlinearity conditions imposed on the forward operator in a neighbourhood of the solution . In this context, the radius which restricts the validity area of stability estimates can be rather small. In all cases of the Case distinction we have here , but only for (a) and (b) also .
Assumption 3**.**
Let for fixed and the conditional stability estimate
[TABLE]
hold, where the constant depends on the largest admissible radius .
Corollary 3.5**.**
The assertion of Proposition 3.1 remains true if Assumption 2 is replaced with Assumption 3.
Proof 3.6**.**
To see the validity of Proposition 3.1 under Assumption 3 in case (a) of the Case distinction, where the regularization parameter choice satisfies (10), it is enough to take the assertion of Corollary 2.3 into account. This assertion implies that for sufficiently small the regularized solutions belong to the ball for prescribed . Then the conditional stability estimate (17) applies and yields the convergence rate (12) along the lines of the proof of [9, Theorem 2.1].
In case (b), however, for the choice (15) of Proposition 3.3 the condition (10) fails and even if is sufficiently small, it cannot be shown that for prescribed . Consequently, the conditional stability estimate (17) need not hold for the regularized solutions and the rate assertion (14) of Proposition 3.3 is only valid under Assumption 3 if constants in (17) exist for arbitrarily large . This is, however, the case in the exponential growth model of Example 1 below.
Now we turn to the cases with oversmoothing penalty, where and restrict ourselves to in the conditional stability estimates. As is well-known since the paper by Natterer [39], convergence rates in this case require lower and upper estimates of by multiples of the term . We start with a corresponding analytical result. The goal of the case studies in Section 5 below is to gain further insight into the behavior of regularized solutions in case (c) for a priori and a posteriori choices of the regularization parameter.
Assumption 4**.**
Let . Moreover, let be an interior point of such that for the radius we have and the two estimates
[TABLE]
and
[TABLE]
hold true, where are constants.
Proposition 3.7**.**
Let for some , but . Under the Assumptions 1 and 4 we then have the rate of convergence of regularized solutions to the exact solution as
[TABLE]
if the regularization parameter is chosen a priori as
[TABLE]
The proof of Proposition 3.7 is given in the appendix along the lines of [25, Theorem 1], where we set for simplicity . Note that Theorem 1 in [25] refers to a simplified version of the pair of estimates (18) and (19), which are ibid both assumed to hold for all . As the proof in the appendix shows, the upper estimate (19) is only exploited by auxiliary elements , which belong to for sufficiently small . On the other hand, there are no arguments for restricting the noisy regularized solutions to small balls. Consequently, the lower estimate (18) needs to hold for all elements in . This is an essential drawback for the application of Proposition 3.7 to practical problems. An analogue of Proposition 3.7 for the discrepancy principle as parameter choice rule can be formulated and proven along the lines of the paper [24].
As already mentioned in Section 2, we stress again that, despite the assertion of Proposition 3.7, norm convergence of regularized solutions cannot be shown in general for case (c), not even weak convergence in can be established. Evidently the parameter choice (21) violates (10) since we have
[TABLE]
It appears that
[TABLE]
tends to be the typical situation in the oversmoothing case (c), at least for regularization parameters yielding optimal convergence rates. Numerical case studies below support this conjecture. A similar behavior of the regularization parameters was noted for oversmoothing -regularization [13].
To conclude and summarize this section, we stress that in all cases of the Case distinction, we have under the appropriate conditional stability assumption (to show the similarities between the cases, we fix for (a), (b), and (c) for the next assertion) and for for some the convergence rate
[TABLE]
under both the discrepancy principle and the a priori parameter choice
[TABLE]
Hence, we obtain the same parameter choice and the same convergence rate as in the case of a linear operator. Namely in [39], (22) and (23) were obtained for a linear operator under a two-sided inequality
[TABLE]
in analogy to the estimates from Assumption 4.
4 Examples
In the following, we introduce two nonlinear inverse problems of type (1), for which we will investigate the analytic results from the previous section numerically. Before doing so, we will introduce two similar, but different Hilbert scales used as penalty in the minimization problem (3) and as measure of the solution smoothness. On one hand, we consider the standard Sobolev-scale . For integer values of , these function spaces consist of functions whose -th derivative is still in . For real parameters of , the spaces can be defined by an interpolation argument [1]. Using Fourier-analysis, one can define a norm in via
[TABLE]
where is the Fourier-transform of . Then iff . The Sobolev scale for does not constitute a Hilbert scale in the strict sense, but for each there is an operator such that is a Hilbert scale [40]. This is not an issue in numerical experiments. Note that the norm (24) is easy to implement, in particular it allows a precise gauging of the solution smoothness.
The reason why the Sobolev scale does not form a Hilbert scale for arbitrary values of lies in the boundary values. In order to generate a full Hilbert scale , we exploit the simple integration operator
[TABLE]
of Volterra-type mapping in and set
[TABLE]
By considering the Riemann-Liouville fractional integral operator and its adjoint for we have that
[TABLE]
cf. [15, 16, 43], and hence by [16, Lemma 8]
[TABLE]
where the fractional Sobolev spaces occur. One can also show that
[TABLE]
On the other hand, it is well-known that for and that is characterized by
[TABLE]
in an explicit manner, see for example [35, Beispiel 2.1.5]. We omit discussing higher smoothness spaces since we will not consider those in our examples. In the following we present examples that show and illustrate the occurrence of the cases (a), (b) and (c) of the Case distinction in Section 1. Note that for the Sobolev-scale and the Hilbert scale induced by coincide.
Model problem 1** (Exponential growth model).**
The following exponential growth model has been previously discussed in the literature, and we refer for more details and properties to [18, Section 3.1] and [20]. To identify the time dependent growth rate of a population we use observations of the time-dependent size of the population with initial size , where the O.D.E. initial value problem
[TABLE]
is assumed to hold. For simplicity let in the sequel and consider the space setting . Then we simply derive the nonlinear forward operator mapping in the real Hilbert space as
[TABLE]
with full domain and with the Fréchet derivative
[TABLE]
It can be shown that there is some constant such that for all the inequality
[TABLE]
is valid. By applying the triangle inequality to (31) we obtain the estimate
[TABLE]
for all , where the constant attains the form for arbitrary .
Using the Hilbert scale generated by the operator from (25), taking into account that for all , and that there is some such that for the multiplier function in , there is a constant satisfying
[TABLE]
This implies by formula (32) the estimate
[TABLE]
This estimate is of the form (17) with and . But it is specific for this example that there exist constants for arbitrarily large radii such that (33) is valid.
The case (a) of the Case distinction in Section 1 occurs due to formula (28) if the solution is sufficiently smooth, i.e. for some and, for the Hilbert scale induced by , it fulfills the necessary boundary conditions. Case (b) will be the subject of Model problem 3 below. The oversmoothing case (c) of the Case distinction occurs either if the solution is insufficiently smooth, i.e. for , or in case of the Hilbert scale induced by , one might have for but the boundary condition fails. Due to formula (27) we then have for all , but for all and consequently also . This is, for example, the case for the constant function . We complete this example with the remark that due to formula (29) a function , like the function used in the case studies below and satisfying , does not belong to whenever its first derivative at does not vanish.
Model problem 2** (Autoconvolution).**
As a second problem, we consider under the same space setting the autoconvolution operator on the unit interval defined as
[TABLE]
with full domain . This operator and the associated nonlinear operator equation (1) with applications in statistics and physics have been discussed early in the literature of inverse problems (cf. [14]). Due to extensions in laser optics, the deautoconvolution problem was comprehensively revisited recently (see, e.g., [5] and [12]). Even though from (34) is a non-compact operator, we have for all a compact Fréchet derivative
[TABLE]
Taking the Hilbert scale based on the operator from (26) and the integral operator from (25), we see for the specific solution
[TABLE]
that
[TABLE]
Unfortunately no estimate of the form (32) is available, because such estimates with -differences on the right-hand side are not known for the autoconvolution operator. However, as a condition characterizing the nonlinearity of the inequality
[TABLE]
is valid. Thus we have for all and from (35), by using the triangle inequality,
[TABLE]
[TABLE]
Using the interpolation inequality (7) in the form
[TABLE]
we derive for the inequality
[TABLE]
and, if moreover , even the conditional stability estimate
[TABLE]
The estimate (36) can only unfold a stabilizing effect if approximate solutions are such that for some . For from (35) with we have , but regularized solutions solving the extremal problem (3) have by definition the property , which implies that . This is a pitfall, because convergence assertions for as are missing in case (c) and thus the behaviour of remains completely unclear.
Model problem 3** (Situation of meeting case (b)).**
It is not straight forward to construct an example for case (b) of Case distinction. We base our construction on the observation that the series is convergent, i.e. it characterizes a finite value, whereas the series is divergent for all , i.e. we have . In order to be able to use the model operators and the Hilbert scale introduced before, we use the following integral formulation.
Lemma 4.1**.**
The improper integral converges for and diverges for .
Proof 4.2**.**
It is
[TABLE]
, where . The claim follows since
[TABLE]
Hence, we construct exact solutions via their Fourier transform
[TABLE]
to obtain, after an inverse Fourier transform, solutions , but for arbitrarily small . Namely, for this , the -norm in Fourier-domain (24) reads
[TABLE]
Since we have little control over the boundary values through this approach, we will only consider the Hilbert scale induced by (26) for .
5 Case studies
In this section we provide numerical evidence for the behavior of regularized solutions with respect to the Case distinction from Section 1 and the Model problems from Section 4.
5.1 Numerical studies for Model Problem 1
We consider the forward operator from (30) in the setting , . As was shown, a conditional stability estimate of the form (17) is valid there with and (cf. formula (33)). It must be emphasized that Assumption 3 applies even in an extended manner, which means that there are finite constants for arbitrarily large radii such that (33) is valid.
In our first set of experiments, we will investigate the interplay between the value , -rates of the regularization parameter and error rates of regularized solutions using several test cases. To this end, we consider five reference solutions as shown in Figure 1. Of these examples, only RS5 fulfills the boundary condition , hence RS1-RS4 can only be an element of for . Since for RS5 , we have in this case for .
To confirm our theoretical findings of Section 3, we solve (3) using, after discretization via the trapezoidal rule for the integral, the MATLAB®-function fmincon. Typically, we use a discretization level . To the simulated data we add random noise for which we prescribe the relative error such that , i.e., we have (2) with . To obtain the norm in the penalty, we set and additionally force the boundary condition . The regularization parameter is chosen as using the discrepancy principle, i.e.,
[TABLE]
with some prescribed multiplier . Unless otherwise noted C=1.1 was used. From Section 3, we know that this should yield a -rate similar to the a-priori choice
[TABLE]
cf. formula (23), that has already been used by Natterer in [39] for linear problems in the case of oversmoothing penalties. We should also be able to observe the order optimal convergence rate
[TABLE]
Since is known, we can compute the regularization errors . We interpret this as a function of and make a regression for the model function
[TABLE]
and similarly we estimate the function behind the regularization parameter through the ansatz
[TABLE]
Comparing (39) and the predicted rate (22), we have , hence we can estimate the smoothness of the solution as . Recall that in this example. Results on regularized solutions with the discrepancy principle for all five reference solutions are summarized in Table 1. From this estimated , we can calculate the a-priori parameter choice (23) and compare it to the measured one. Results on regularized solutions with the discrepancy principle for all five reference solutions are summarized in Table 1.
As discussed before, the reference solutions RS1, RS2, RS3 and RS4 all belong to case (c) of the Case distinction whereas RS5 belongs to case (a). Our computed results fit to this narrative. For RS1–RS4 we obtain an estimated and , i.e., as . As expected we have for RS5 () together with as . For RS1 we know that is bounded above by 0.5 and the estimated value 0.487 fits well. In particular in the oversmoothing cases, we have an excellent fit between the -rates from the discrepancy principle and the a-priori choice based on our estimate of .
As a second scenario for this model problem, we use the Sobolev scale , to investigate a particular case of (c) in our Case distinction. Using the Fourier transform, we construct our solutions such that which yields solutions for all , but . This follows, because converges for (but diverges for ) and the definition of the -norm (24) in Fourier domain. We take and in principal repeat the previous experiments with the new solutions. The main difference is that we now minimize a Tikhonov functional with variable penalty smoothness,
[TABLE]
From Section 2 we would expect for , for , and for . The numerical results confirm this behavior, see Figure 2 for a plot and Table 2 for the regression results along (39) and (40). Note that in particular the exponent in the convergence rate remains approximately constant as predicted by the theory.
Note that the “bumpy” structure in Figure 2 and related plots below are due to the discrepancy principle as exemplified in Figure 3 for .
5.2 Numerical studies for Model Problem 2
We now turn to the autoconvolution operator from (34). In this context, we consider only the specific solution , where , and the minimization problem (3). It must be emphasized that here, in contrast to model problem 1, Assumption 3 does not apply for any radius . It is therefore completely unclear which behavior the regularized solutions show when the noise level tends to zero. It is a pitfall for exploiting Tikhonov regularization to get stable approximations for when the regularized solutions from case (c), i.e., , do not meet the validity area of the conditional stability estimate even if is sufficiently small. Then due to estimates of type (5) are useless, convergence as cannot be ensured, and the behaviour of the regularized solutions remains unclear. Such a situation occurs, as shown before, in Model problem 2 with and for . The following numerical case studies for that situation enlighten the properties of . For the test computations, again the discrepancy principle according to (38) has been used with and a discretization of grid points over the interval . In particular, we demonstrate that does not tend to zero for .
Figure 4 shows the regularization error depending on the relative noise level . It can be seen, that decreases for decreasing noise levels whenever . If falls below the value , then the monotonicity turns around and begins to grow. As illustrated in the overview of Figure 5, the regularized solutions tend to oscillate for small , especially near the left and right boundaries of the interval in the sense of the Gibbs phenomenon. The Gibbs phenomenon at the right boundary accompanies the required jump from one to zero between and . The oscillations blow up for small values of (Figure 5 (c)–(f)) and indicate non-convergence of for . Note that the Gibbs phenomenon starts to appear around the minimum of , compare to Figure 4.
To confirm that this phenomenon is inherent to the oversmoothing situation, we consider again the Tikhonov functional (41) with -penalty for , and respectively. As for we expect similar asymptotic behavior of for as at the end of Section 5.1. Figure 6 shows the result.
5.3 Numerical studies for Model Problem 3
Based on the case destinction in Section 1 we now study the convergence rates and properties of as decays to zero for the Model Problem 3 in case (b) of Case distinction. Using the Sobolev-scale with norm (24) we define , but via (37). For given in the above sense, we then turn to the Tikhonov functional (41) with penalty in . Again we choose which means such that we can employ the theory from Model Problem 1. For we are in the classical setting and therefore expect as , for we are in a oversmoothing situation and expect that . Letting yields precisely case (b) of the Case distinction, and should remain approximately constant. The numerical results, see Figure 7 and Table 3, confirm this. Note that, since and , we expect and obtain . We also see that the for s=0.1, for , i.e. in the oversmoothing situation, and and therefore approximately constant for the situation where and penalty term are of the same smoothness.
Appendix: Proof of Proposition 3.7
In this proof we set . To prove the convergence rate result (20) under the a priori parameter choice (21) it is sufficient to show that for sufficiently small there are two constants and such that the inequalities
[TABLE]
and
[TABLE]
hold. Namely, the convergence rate (20) follows directly from inequality chain
[TABLE]
which is valid for sufficiently small as a consequence of (42), (43) and of the interpolation inequality for the Hilbert scale .
As an essential tool for the proof we use auxiliary elements , which are for all the uniquely determined minimizers over all of the artificial Tikhonov functional
[TABLE]
Note that the elements are independent of the noise level and belong by definition to , which is in strong contrast to .
The following lemma is an immediate consequence of [24, Prop. 2], see also [25, Prop. 3].
Lemma 5.1**.**
Let and be the minimizer of the functional from (44) over all . Given as defined by formula (21) the resulting element obeys the bounds
[TABLE]
and
[TABLE]
Due to (45) we have as . Hence by Assumption 4, in particular because is an interior point of , for sufficiently small the element belongs to and moreover with the inequality (19) applies for and such small .
Instead of the inequality (8), which is missing in case of oversmoothing penalties, we can use here the inequality
[TABLE]
as minimizing property for the Tikhonov functional. Using (48) it is enough to bound by with
[TABLE]
in order to obtain the estimates
[TABLE]
Since the inequality (19) applies for and sufficiently small , we can estimate for such as follows:
[TABLE]
This ensures the estimates (50) and (51). Based on this we are going now to show that an inequality (42) is valid for some . Here, we use the inequality (18) of Assumption 4, which applies for , and we find
[TABLE]
where is the constant from (49) and we derive .
Secondly, we still have to show the existence of a constant such that the inequality (43) holds. By using the triangle inequality in combination with (51) and (47) we find that
[TABLE]
Again, we use the interpolation inequality and can estimate further as
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Finally, we have now
[TABLE]
This shows (43) and thus completes the proof of Proposition 3.7. ∎
Acknowledgment
We thank the colleagues Volker Michel and Robert Plato from the University of Siegen for a hint to the series that allowed us to formulate Model problem 3. The research was financially supported by Deutsche Forschungsgemeinschaft (DFG-grant HO 1454/12-1).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. A. Adams and J. F. J. Fournier. Sobolev spaces. Elsevier/Academic Press, Amsterdam, 2003.
- 2[2] S. W. Anzengruber, B. Hofmann, and P. Mathé. Regularization properties of the sequential discrepancy principle for Tikhonov regularization in Banach spaces. Appl. Anal. , 93(7):1382–1400, 2014.
- 3[3] S. W. Anzengruber and R. Ramlau. Morozov’s discrepancy principle for Tikhonov-type functionals with nonlinear operators. Inverse Problems , 26(2):025001 (17pp), 2010.
- 4[4] R. I. Boţ and B. Hofmann. An extension of the variational inequality approach for obtaining convergence rates in regularization of nonlinear ill-posed problems. Journal of Integral Equations and Applications , 22(3):369–392, 2010.
- 5[5] S. Bürger and B. Hofmann. About a deficit in low order convergence rates on the example of autoconvolution. Applicable Analysis , 94:477–493, 2015.
- 6[6] M. Burger, J. Flemming, and B. Hofmann. Convergence rates in ℓ 1 superscript ℓ 1 \ell^{1} -regularization if the sparsity assumption fails. Inverse Problems , 29:025013 (16pp), 2013.
- 7[7] J. Cheng, B. Hofmann, and S. Lu. The index function and Tikhonov regularization for ill-posed problems. J. Comput. Appl. Math. , 265:110–119, 2014.
- 8[8] J. Cheng and M. Yamamoto. On new strategy for a priori choice of regularizing parameters in Tikhonov’s regularization. Inverse Problems , 16:L 31–L 38, 2000.
