Convergence rate analysis of Galerkin approximation of inverse potential problem
In this work we analyze the inverse problem of recovering a space-dependent potential
coefficient in an elliptic/parabolic problem from distributed observation. We establish novel …
coefficient in an elliptic/parabolic problem from distributed observation. We establish novel …
Convergence rates of Tikhonov regularizations for elliptic and parabolic inverse radiativity problems
We shall study in this paper the convergence rates of the Tikhonov regularized solutions for
the recovery of the radiativities in elliptic and parabolic systems in general dimensional …
the recovery of the radiativities in elliptic and parabolic systems in general dimensional …
Semismooth Newton and quasi-Newton methods in weighted ℓ1-regularization
We investigate semismooth Newton and quasi-Newton methods for minimization problems
arising from weighted ℓ1-regularization. We give proofs of the local convergence of these …
arising from weighted ℓ1-regularization. We give proofs of the local convergence of these …
Convergence rates for total variation regularization of coefficient identification problems in elliptic equations I
We investigate the convergence rates for total variation regularization of the problem of
identifying (i) the coefficient q in the Neumann problem for the elliptic equation, and (ii) the …
identifying (i) the coefficient q in the Neumann problem for the elliptic equation, and (ii) the …
[PDF][PDF] Regularization Methods for Ill-Posed Problems.
J Cheng, B Hofmann - Handbook of Mathematical Methods in …, 2015 - academia.edu
In this chapter are outlined some aspects of the mathematical theory for direct regularization
methods aimed at the stable approximate solution of nonlinear illposed inverse problems …
methods aimed at the stable approximate solution of nonlinear illposed inverse problems …
[HTML][HTML] Descent gradient methods for nonsmooth minimization problems in ill-posed problems
Descent gradient methods are the most frequently used algorithms for computing
regularizers of inverse problems. They are either directly applied to the discrepancy term …
regularizers of inverse problems. They are either directly applied to the discrepancy term …
On learning the optimal regularization parameter in inverse problems
Selecting the best regularization parameter in inverse problems is a classical and yet
challenging problem. Recently, data-driven approaches based on supervised learning have …
challenging problem. Recently, data-driven approaches based on supervised learning have …
Convergence rates for total variation regularization of coefficient identification problems in elliptic equations II
We investigate the convergence rates for total variation regularization of the problem of
identifying (i) the coefficient q in the Neumann problem for the elliptic equation− div (q∇ u) …
identifying (i) the coefficient q in the Neumann problem for the elliptic equation− div (q∇ u) …
[PDF][PDF] Gradient descent for Tikhonov functionals with sparsity constraints: theory and numerical comparison of step size rules
In this paper, we analyze gradient methods for minimization problems arising in the
regularization of nonlinear inverse problems with sparsity constraints. In particular, we study …
regularization of nonlinear inverse problems with sparsity constraints. In particular, we study …
Oversmoothing Tikhonov regularization in Banach spaces
This paper develops a Tikhonov regularization theory for nonlinear ill-posed operator
equations in Banach spaces. As the main challenge, we consider the so-called …
equations in Banach spaces. As the main challenge, we consider the so-called …