Relaxation methods for image reconstruction
From MaRDI portal
Cited in
(22)- A randomized Kaczmarz algorithm with exponential convergence
- A relaxed version of Bregman's method for convex programming
- Strong convergence of projection-like methods in Hilbert spaces
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- An iterative row-action method for interval convex programming
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- The extensions of convergence rates of Kaczmarz-type methods
- Single projection Kaczmarz extended algorithms
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- A geometric approach to quadratic optimization: an improved method for solving strongly underdetermined systems in CT
- Sampled limited memory methods for massive linear inverse problems
- An analysis of stochastic variance reduced gradient for linear inverse problems *
- On the Convergence of Stochastic Gradient Descent for Nonlinear Ill-Posed Problems
- Randomized Projection Methods for Linear Systems with Arbitrarily Large Sparse Corruptions
- Parallel ART for image reconstruction in CT using processor arrays
- Faster randomized block sparse Kaczmarz by averaging
- On the convergence of stochastic variance reduced gradient for linear inverse problems
- Convergence properties of ART and SOR algorithms
- Line search acceleration of iterative methods
This page was built for publication: Relaxation methods for image reconstruction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4144224)
