Conjugate gradient based acceleration for inverse problems
From MaRDI portal
Abstract: The conjugate gradient method is a widely used algorithm for the numerical solution of a system of linear equations. It is particularly attractive because it allows one to take advantage of sparse matrices and produces (in case of infinite precision arithmetic) the exact solution after a finite number of iterations. It is thus well suited for many types of inverse problems. On the other hand, the method requires the computation of the gradient. Here difficulty can arise, since the functional of interest to the given inverse problem may not be differentiable. In this paper, we review two approaches to deal with this situation: iteratively reweighted least squares and convolution smoothing. We apply the methods to a more generalized, two parameter penalty functional. We show advantages of the proposed algorithms using examples from a geotomographical application and for synthetically constructed multi-scale reconstruction and regularization parameter estimation.
Recommendations
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- An iteratively reweighted least squares algorithm for sparse regularization
- Conjugate gradient acceleration of iteratively re-weighted least squares methods
- Fast \(l_ p\) solution of large, sparse, linear systems: Application to seismic travel time tomography
- scientific article; zbMATH DE number 4048080 (Why is no real title available?)
- scientific article; zbMATH DE number 1972340 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Iteratively reweighted least squares minimization for sparse recovery
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- The conjugate gradient method in extremal problems
Cited in
(17)- The conjugate gradient regularization method in computed tomography problems
- Gradient computation in a nonlinear inverse problem.
- Accelerated variational PDEs for efficient solution of regularized inversion problems
- A Bayesian conjugate gradient method (with discussion)
- A generalized computationally efficient inverse characterization approach combining direct inversion solution initialization with gradient-based optimization
- A conjugate gradient-neural network technique for ultrasound inverse imaging
- A stopping rule for the conjugate gradient regularization method applied to inverse problems in acoustics
- Applications of the conjugate gradient method in optimal surface parameterizations
- scientific article; zbMATH DE number 4112144 (Why is no real title available?)
- Tradeoffs Between Convergence Speed and Reconstruction Accuracy in Inverse Problems
- A NUMERICAL STUDY OF CONJUGATE GRADIENT DIRECTIONS FOR AN ULTRASOUND INVERSE PROBLEM
- An improved CD method for solving linear inverse problem
- Nonlinear conjugate gradient method for spectral tomosynthesis
- A spectral conjugate gradient method for nonlinear inverse problems
- Fast convergence strategy for ambiguous inverse problems based on hierarchical regularization
- Accelerated projected gradient method for linear inverse problems with sparsity constraints
- An accelerated Gauss-Seidel method for inverse modeling
This page was built for publication: Conjugate gradient based acceleration for inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1686866)
