Pages that link to "Item:Q4144224"

The following pages link to Relaxation methods for image reconstruction (Q4144224):

Displaying 17 items.

• Single projection Kaczmarz extended algorithms (Q342879) (← links)
• A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
• Convergence properties of ART and SOR algorithms (Q758103) (← links)
• Line search acceleration of iterative methods (Q915366) (← links)
• A randomized Kaczmarz algorithm with exponential convergence (Q1027734) (← links)
• A relaxed version of Bregman's method for convex programming (Q1067977) (← links)
• Strong convergence of projection-like methods in Hilbert spaces (Q1089908) (← links)
• On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
• Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
• An iterative row-action method for interval convex programming (Q1138236) (← links)
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction (Q1155333) (← links)
• Strong underrelaxation in Kaczmarz's method for inconsistent systems (Q1166890) (← links)
• A projection method for least-squares solutions to overdetermined systems of linear inequalities (Q1821512) (← links)
• The extensions of convergence rates of Kaczmarz-type methods (Q2196068) (← links)
• Sampled limited memory methods for massive linear inverse problems (Q5000590) (← links)
• An analysis of stochastic variance reduced gradient for linear inverse problems ^* (Q5019935) (← links)
• Faster randomized block sparse Kaczmarz by averaging (Q6109882) (← links)