Related papers: Source Conditions for non-quadratic Tikhonov Regul…
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…
In this paper we consider variational regularization methods for inverse problems with large noise that is in general unbounded in the image space of the forward operator. We introduce a Banach space setting that allows to define a…
We study the choice of the regularisation parameter for linear ill-posed problems in the presence of noise that is possibly unbounded but only finite in a weaker norm, and when the noise-level is unknown. For this task, we analyse several…
In this paper, we propose a first second-order scheme based on arbitrary non-Euclidean norms, incorporated by Bregman distances. They are introduced directly in the Newton iterate with regularization parameter proportional to the square…
This study proposes a cubic regularization of the Newton method for generating weakly efficient points of unconstrained vector optimization problems under no convexity assumption on the objective function. It is observed that at a given…
In this paper, we present the analytical and numerical study of the optimization approach for determining the space-dependent source function in the parabolic inverse source problem using partial boundary measurements. The Lagrangian…
Motivated by applications in optimization and machine learning, we consider stochastic quasi-Newton (SQN) methods for solving stochastic optimization problems. In the literature, the convergence analysis of these algorithms relies on strong…
The use of second order information on the forward operator often comes at a very moderate additional computational price in the context of parameter identification probems for differential equation models. On the other hand the use of…
We present a converged algorithm for Tikhonov regularized nonnegative matrix factorization (NMF). We specially choose this regularization because it is known that Tikhonov regularized least square (LS) is the more preferable form in solving…
We describe a general strategy for the verification of variational source condition by formulating two sufficient criteria describing the smoothness of the solution and the degree of ill-posedness of the forward operator in terms of a…
For the first time, we develop in this paper the globally convergent convexification numerical method for a Coefficient Inverse Problem for the 3D Helmholtz equation for the case when the backscattering data are generated by a point source…
In this paper we generalise the results proved in [N. Katzourakis, An $L^\infty$ regularisation strategy to the inverse source identification problem for elliptic equations, SIAM J. Math. Anal. 51:2, 1349-1370 (2019)] by studying the…
It is common to have to process signals, whose values are points on the 3-D sphere. We consider a Tikhonov-type regularization model to smoothen or interpolate sphere-valued signals defined on arbitrary graphs. We propose a convex…
The standard assumption for proving linear convergence of first order methods for smooth convex optimization is the strong convexity of the objective function, an assumption which does not hold for many practical applications. In this…
In this paper, we study the iteration complexity of cubic regularization of Newton method for solving composite minimization problems with uniformly convex objective. We introduce the notion of second-order condition number of a certain…
Tikhonov regularization is one of the most commonly used methods of regularization of ill-posed problems. In the setting of finite element solutions of elliptic partial differential control problems, Tikhonov regularization amounts to…
We consider a class of inexact Newton regularization methods for solving nonlinear inverse problems in Hilbert scales. Under certain conditions we obtain the order optimal convergence rate result.
Many applications in science and engineering require the solution of large linear discrete ill-posed problems that are obtained by the discretization of a Fredholm integral equation of the first kind in several space-dimensions. The matrix…
Measuring the error by an l^1-norm, we analyze under sparsity assumptions an l^0-regularization approach, where the penalty in the Tikhonov functional is complemented by a general stabilizing convex functional. In this context, ill-posed…
In a recent paper by A. Chambolle et al. [Geometric properties of solutions to the total variation denoising problem. Inverse Problems 33, 2017] it was proven that if the subgradient of the total variation at the noise free data is not…