A descent method for regularization of ill-posed problems
Suppose we have an inverse problem modelled by \(Hx=y\) where \(H\) denotes a linear compact operator between the Hilbert spaces \(X\) and \(Y\).The data \(y\) is observed with a limited precision so we get only \(\| y^{\delta}-y\| \leq \delta \). To say that the inverse problem is ill-posed is equivalent to the unboundedness of the set: \[ \{ x\in X: \| Hx-y^{\delta} \| \leq \delta\}. \] The problem is equivalent to finding via the Tikhonov-Philips regularization procedure a solution which solves the minimum problem: \[ \min_{x}\phi(x,\lambda), \quad\phi(x,\lambda)=\| Hx-y\| ^{2}+\lambda(\| x\| ^{2}-\gamma^{2}), \] Here \(\lambda\) is the regularization parameter and \(\gamma\) a constant. The authors derive an iterative procedure where no knowledge of the noise level is assumed and in which the functional \(\phi(x,\lambda)\) decreases at each level. The method is based on the truncation of the inner iterations as soon as a suitable updating value is obtained for the outer iteration. The paper concludes with some numerical experiments.
- Iterated Tikhonov regularization for ill-posed problems
- TIGRA an iterative algorithm for regularizing nonlinear ill-posed problems
- scientific article; zbMATH DE number 3963111
- An inner-outer regularizing method for ill-posed problems
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- A B-spline parametric model for high resolution dynamic magnetic resonance imaging
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- Choosing regularization parameters in iterative methods for ill-posed problems
- Fast CG-Based Methods for Tikhonov--Phillips Regularization
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Practical Approximate Solutions to Linear Operator Equations When the Data are Noisy
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Test Matrices for Regularization Methods
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The discrete Picard condition for discrete ill-posed problems
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Steepest descent, CG, and iterative regularization of ill-posed problems
- Representation of high resolution images from low sampled Fourier data: applications to dynamic MRI
- On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
- A double optimal descent algorithm for iteratively solving ill-posed linear inverse problems
- Regularization without preliminary knowledge of smoothness and error behaviour
- A steepest descent algorithm for the global minimization of the Tikhonov functional
- An inner-outer regularizing method for ill-posed problems
- An experiment of parallel SPECT data reconstruction
- A control Liapunov function approach to generalized and regularized descent methods for zero finding
- Krylov methods for inverse problems: Surveying classical, and introducing new, algorithmic approaches
- An automatic regularization parameter selection algorithm in the total variation model for image deblurring
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
This page was built for publication: A descent method for regularization of ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717546)
