Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations

DOI10.1515/jiip-2015-0082zbMath1355.65054MaRDI QIDQ511032

Mokhtar Abbasi, Tommy Elfving, Touraj Nikazad

Publication date: 14 February 2017

Published in: Journal of Inverse and Ill-Posed Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jiip-2015-0082

zbMATH Keywords

tomography; image reconstruction from projections; Kaczmarz's and Landweber iterations; relaxation parameters (step size); simultaneous and sequential block algorithm; steepest decent

Mathematics Subject Classification ID

65F10: Iterative numerical methods for linear systems

65N21: Numerical methods for inverse problems for boundary value problems involving PDEs

65N20: Numerical methods for ill-posed problems for boundary value problems involving PDEs

Uses Software

• AIR tools
• SNARK09
• SNARK93

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence analysis of a block iterative version of the loping Landweber-Kaczmarz iteration
• Iterative methods for fixed point problems in Hilbert spaces
• Semi-convergence and relaxation parameters for a class of SIRT algorithms
• Line search acceleration of iterative methods
• On steepest-descent-Kaczmarz methods for regularizing systems of nonlinear ill-posed equations
• Generalizations of the projection method with applications to SOR theory for Hermitian positive semidefinite linear systems
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• Accelerated Landweber iterations for the solution of ill-posed equations
• Convergence of sequential and asynchronous nonlinear paracontractions
• An acceleration scheme for cyclic subgradient projections method
• AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
• Volumetric restrictions in single particle 3DEM reconstruction
• Extrapolation algorithm for affine-convex feasibility problems
• Fundamentals of Computerized Tomography
• Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
• Contraining Strategies for Linear Iterative Processes
• Extended and constrained diagonal weighting algorithm with application to inverse problems in image reconstruction
• Perturbation resilience and superiorization of iterative algorithms
• On Diagonally Relaxed Orthogonal Projection Methods
• Properties of a class of block-iterative methods
• Decomposition through formalization in a product space
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Gradient Method with Retards and Generalizations
• Rank-Deficient and Discrete Ill-Posed Problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
• Accelerated perturbation-resilient block-iterative projection methods with application to image reconstruction
• Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
• Relaxed steepest descent and Cauchy-Barzilai-Borwein method