Non‐stationary iterated Tikhonov–Morozov method and third‐order differential equations for the evaluation of unbounded operators

In this paper we analyse the non‐stationary iterative Tikhonov–Morozov method analytically and numerically for the stable evaluation of differential operators and for denoizing images. A relationship between non‐stationary iterative Tikhonov–Morozov regularization and a filtering technique based on a differential equation of third order is established and both methods are shown to be effective for denoizing images and for the stable evaluation of differential operators. The theoretical results are verified numerically on model problems in ultrasound imaging and numerical differentiation. Copyright © 2000 John Wiley & Sons, Ltd.     

约束Fractional Tikhonov正则化的模迭代方法

反问题是现在数学物理研究中的一个热点问题,而反问题求解面临的一个本质性困难是不适定性。求解不适定问题的普遍方法是:用与原不适定问题相“邻近”的适定问题的解去逼近原问题的解,这种方法称为正则化方法.如何建立有效的正则化方法是反问题领域中不适定问题研究的重要内容.当前,最为流行的正则化方法有基于变分原理的Tikhonov正则化及其改进方法,此类方法是求解不适定问题的较为有效的方法,在各类反问题的研究中被广泛采用,并得到深入研究.     

On the choice of solution subspace for nonstationary iterated Tikhonov regularization

Tikhonov regularization is a popular method for the solution of linear discrete ill-posed problems with error-contaminated data. Nonstationary iterated Tikhonov regularization is known to be able to determine approximate solutions of higher quality than standard Tikhonov regularization. We investigate the choice of solution subspace in iterative methods for nonstationary iterated Tikhonov regularization of large-scale problems. Generalized Krylov subspaces are compared with Krylov subspaces that are generated by Golub–Kahan bidiagonalization and the Arnoldi process. Numerical examples illustrate the effectiveness of the methods.     

Finite perturbation of convex programs

This paper concerns a characterization of the finite-perturbation property of a convex program. When this property holds, finite perturbation of the objective function of a convex program leads to a solution of the original problem which minimizes the perturbation function over the set of solutions of the original problem. This generalizes a finite-termination property of the proximal point algorithm for linear programs and characterizes finite Tikhonov regularization of convex programs.This material is based on research supported by National Science Foundation Grants DCR-8521228 and CCR-8723091 and Air Force Office of Scientific Research Grants AFOSR-86-0172 and AFOSR-89-0410.     

Prox-regularization and solution of ill-posed elliptic variational inequalities

In this paper new methods for solving elliptic variational inequalities with weakly coercive operators are considered. The use of the iterative prox-regularization coupled with a successive discretization of the variational inequality by means of a finite element method ensures well-posedness of the auxiliary problems and strong convergence of their approximate solutions to a solution of the original problem.In particular, regularization on the kernel of the differential operator and regularization with respect to a weak norm of the space are studied. These approaches are illustrated by two nonlinear problems in elasticity theory.     

Optimal order results for a class of regularization methods using unbounded operators

A class of regularization methods using unbounded regularizing operators is considered for obtaining stable approximate solutions for ill-posed operator equations. With an a posteriori as well as an a priori parameter choice strategy, it is shown that the method yields the optimal order. Error estimates have also been obtained under stronger assumptions on the generalized solution. The results of the paper unify and simplify many of the results available in the literature. For example, the optimal results of the paper include, as particular cases for Tikhonov regularization, the main result of Mair (1994) with an a priori parameter choice, and a result of Nair (1999) with an a posteriori parameter choice. Thus the observations of Mair (1994) on Tikhonov regularization of ill-posed problems involving finitely and infinitely smoothing operators is applicable to various other regularization procedures as well. Subsequent results on error estimates include, as special cases, an optimal result of Vainikko (1987) and also some recent results of Tautenhahn (1996) in the setting of Hilbert scales.     

Duality-based regularization in a linear convex mathematical programming problem

For a linear convex mathematical programming (MP) problem with equality and inequality constraints in a Hilbert space, a dual-type algorithm is constructed that is stable with respect to input data errors. In the algorithm, the dual of the original optimization problem is solved directly on the basis of Tikhonov regularization. It is shown that the necessary optimality conditions in the original MP problem are derived in a natural manner by using dual regularization in conjunction with the constructive generation of a minimizing sequence. An iterative regularization of the dual algorithm is considered. A stopping rule for the iteration process is presented in the case of a finite fixed error in the input data.     

Morozov's discrepancy principle for tikhonov

In this paper severely ill-posed problems are studied which are represented in the form of linear operator equations with infinitely smoothing operators but with solutions having only a finite smoothness. It is well known, that the combination of Morozov's discrepancy principle and a finite dimensional version of the ordinary Tikhonov regularization is not always optimal because of its saturation property. Here it is shown, that this combination is always order-optimal in the case of severely ill-posed problems.     

ON THE ASYMPTOTIC ORDER OF TIKHONOV REGULARIZATION WITH OPERATORS ANDDATA ERROR

1IntroductionAgreatmanylinearinverseproblemsofmathematicalphysicsmaybefi.allledinanabstractsettingaslinearoperatorequationsoftheform.Ti=y,(1)whichimplicitlydefinesthesolutionxoofthegivenproblem.ThedesiredsolutionxoisOftengi'venintermsoftheMoors-PenrosegeneralizedinverseT intheformxo=T y([1]).InallinterestingcasesthegeneralizedinverseisanunboundedoperatorandthechallengeisthentoprovideapproximationstotheunknownsolutionT ythatarestablewithrespecttoperturbationsinthedatay.'Aprototypefortheequat…     

Regularized dual method for nonlinear mathematical programming

For a nonlinear programming problem with equality constraints in a Hilbert space, a dual-type algorithm is constructed that is stable with respect to input data errors. The algorithm is based on a modified dual of the original problem that is solved directly by applying Tikhonov regularization. The algorithm is designed to determine a norm-bounded minimizing sequence of feasible elements. An iterative regularization of the dual algorithm is considered. A stopping rule for the iteration process is given in the case of a finite fixed error in the input data.     

On nondecreasing sequences of regularization parameters for nonstationary iterated Tikhonov

Nonstationary iterated Tikhonov is an iterative regularization method that requires a strategy for defining the Tikhonov regularization parameter at each iteration and an early termination of the iterative process. A classical choice for the regularization parameters is a decreasing geometric sequence which leads to a linear convergence rate. The early iterations compute quickly a good approximation of the true solution, but the main drawback of this choice is a rapid growth of the error for later iterations. This implies that a stopping criteria, e.g. the discrepancy principle, could fail in computing a good approximation. In this paper we show by a filter factor analysis that a nondecreasing sequence of regularization parameters can provide a rapid and stable convergence. Hence, a reliable stopping criteria is no longer necessary. A geometric nondecreasing sequence of the Tikhonov regularization parameters into a fixed interval is proposed and numerically validated for deblurring problems.     

A comparison of some inverse methods for estimating the initial condition of the heat equation

In this work we analyze two explicit methods for the solution of an inverse heat conduction problem and we confront them with the least-squares method, using for the solution of the associated direct problem a classical finite difference method and a method based on an integral formulation. Finally, the Tikhonov regularization connected to the least-squares criterion is examined. We show that the explicit approaches to this inverse heat conduction problem will present disastrous results unless some kind of regularization is used.     

MODIFIED DISCREPANCY PRINCIPLES WITH PERTURBED OPERATORS AND NOISY DATA

1.IntroductionLetX,YberealHilbertspaces,T:X-Yab0ulldedlinear0perat0rwithnonclosedrangeR(T),yED(T+)=R(T)+R(T)",whereT+istheM0ore-PenroseinverseofTl11.Foreachb>0,lety6EYbesuchthatIly-ueIls6.(1)Asweknow,theproblemofsolvingtheoperatorequationofthefirstkindTx=y(2)..is,ingenerality,ill-p0sedl2].Alsowecann0tensurethatT+Wisareas0nableapproximation0fT+ysinceT+isaUnbounded0perat0r-Inpractice,onetriestoc0nstructastableaPprokimate6olutiontotheequation(2)byregularizationmeth0ds.Awell-knownregu…     

Regularization method with two parameters for nonlinear ill-posed problems

This paper is devoted to the regularization of a class of nonlinear ill-posed problems in Banach spaces. The operators involved are multi-valued and the data are assumed to be known approximately. Under the assumption that the original problem is solvable, a strongly convergent approximation procedure is designed by means of the Tikhonov regularization method with two pa- rameters.     

改进的Tikhonov 正则化及其正则解的最优渐近阶估计

对于算子与右端都有扰动的第一类算子方程建立了一类新的正则化方法(称为改进的 Ｔｉｋｈｏｎｏｖ正则化)．应用紧算子的奇异系统和广义 Ａｒｃａｎｇｅｌｉ方法后验选取正则参数,证明了正则解具有最优的渐近阶并给出了相应的算例分析．     

Progressive Regularization of Variational Inequalities and Decomposition Algorithms

For nonsymmetric operators involved in variational inequalities, the strong monotonicity of their possibly multivalued inverse operators (referred to as the Dunn property) appears to be the weakest requirement to ensure convergence of most iterative algorithms of resolution proposed in the literature. This implies the Lipschitz property, and both properties are equivalent for symmetric operators. For Lipschitz operators, the Dunn property is weaker than strong monotonicity, but is stronger than simple monotonicity. Moreover, it is always enforced by the Moreau–Yosida regularization and it is satisfied by the resolvents of monotone operators. Therefore, algorithms should always be applied to this regularized version or they should use resolvents: in a sense, this is what is achieved in proximal and splitting methods among others. However, the operation of regularization itself or the computation of resolvents may be as complex as solving the original variational inequality. In this paper, the concept of progressive regularization is introduced and a convergent algorithm is proposed for solving variational inequalities involving nonsymmetric monotone operators. Essentially, the idea is to use the auxiliary problem principle to perform the regularization operation and, at the same time, to solve the variational inequality in its approximately regularized version; thus, two iteration processes are performed simultaneously, instead of being nested in each other, yielding a global explicit iterative scheme. Parallel and sequential versions of the algorithm are presented. A simple numerical example demonstrates the behavior of these two versions for the case where previously proposed algorithms fail to converge unless regularization or computation of a resolvent is performed at each iteration. Since the auxiliary problem principle is a general framework to obtain decomposition methods, the results presented here extend the class of problems for which decomposition methods can be used.     

A new Tikhonov regularization method

The numerical solution of linear discrete ill-posed problems typically requires regularization, i.e., replacement of the available ill-conditioned problem by a nearby better conditioned one. The most popular regularization methods for problems of small to moderate size, which allow evaluation of the singular value decomposition of the matrix defining the problem, are the truncated singular value decomposition and Tikhonov regularization. The present paper proposes a novel choice of regularization matrix for Tikhonov regularization that bridges the gap between Tikhonov regularization and truncated singular value decomposition. Computed examples illustrate the benefit of the proposed method.     

Extension of GKB‐FP algorithm to large‐scale general‐form Tikhonov regularization

In a recent paper an algorithm for large‐scale Tikhonov regularization in standard form called GKB‐FP was proposed and numerically illustrated. In this paper, further insight into the convergence properties of this method is provided, and extensions to general‐form Tikhonov regularization are introduced. In addition, as alternative to Tikhonov regularization, a preconditioned LSQR method coupled with an automatic stopping rule is proposed. Preconditioning seeks to incorporate smoothing properties of the regularization matrix into the computed solution. Numerical results are reported to illustrate the methods on large‐scale problems. Copyright © 2013 John Wiley & Sons, Ltd.     

Simultaneous inversion of two initial values for a time‐fractional diffusion‐wave equation

This study is devoted to recovering two initial values for a time‐fractional diffusion‐wave equation from boundary Cauchy data. We provide the uniqueness result for recovering two initial values simultaneously by the method of Laplace transformation and analytic continuation. And then we use a nonstationary iterative Tikhonov regularization method to solve the inverse problem and propose a finite dimensional approximation algorithm to find good approximations to the initial values. Numerical examples in one‐ and two‐dimensional cases are provided to show the effectiveness of the proposed method.     

Fractional Tikhonov regularization for linear discrete ill-posed problems

Tikhonov regularization is one of the most popular methods for solving linear systems of equations or linear least-squares problems with a severely ill-conditioned matrix A. This method replaces the given problem by a penalized least-squares problem. The present paper discusses measuring the residual error (discrepancy) in Tikhonov regularization with a seminorm that uses a fractional power of the Moore-Penrose pseudoinverse of AA ^T as weighting matrix. Properties of this regularization method are discussed. Numerical examples illustrate that the proposed scheme for a suitable fractional power may give approximate solutions of higher quality than standard Tikhonov regularization.