Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
From MaRDI portal
Publication:4785757
DOI10.1137/S089547980138705XzbMath1028.90034MaRDI QIDQ4785757
Publication date: 5 January 2003
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
oblique projectionslinear feasibility problemblock-iterative algorithmssimultaneous algebraic reconstruction techniqueblock-iterative CAVcomponent averaging (CAV)
Related Items
A general extending and constraining procedure for linear iterative methods, A projection method for semidefinite linear systems and its applications, Weighted pseudoinversion with singular weights, Numerical investigation of Fredholm integral equation of the first kind with noisy data, AIR tools II: algebraic iterative reconstruction methods, improved implementation, Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings, A new step size rule for the superiorization method and its application in computerized tomography, A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators, Sampling and reconstruction by means of weighted inverses, Convergence results of Landweber iterations for linear systems, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, The standard forms and convergence theory of the Kaczmarz-Tanabe type methods for solving linear systems, A preconditioned Landweber iteration-based bundle adjustment for large-scale 3D reconstruction, AIR tools -- a MATLAB package of algebraic iterative reconstruction methods, Generalized projections onto convex sets, String-averaging algorithms for convex feasibility with infinitely many sets, On the incomplete oblique projections method for solving box constrained least squares problems, Column-oriented algebraic iterative methods for nonnegative constrained least squares problems, Choosing the relaxation parameter in sequential block-iterativemethods for linear systems, Convergence studies on block iterative algorithms for image reconstruction, Controlling noise error in block iterative methods, Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. I. positive definite weights, Representations and expansions of weighted pseudoinverse matrices, iterative methods, and problem regularization. II. singular weights, Incomplete oblique projections for solving large inconsistent linear systems, Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations, On the string averaging method for sparse common fixed‐point problems, Convergence analysis for column-action methods in image reconstruction, Inexact block Newton methods for solving nonlinear equations, Computational acceleration of projection algorithms for the linear best approximation problem, Weighted pseudoinversion with indefinite weights, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms, Extended Kaczmarz-like methods with oblique projections, The convergence properties for regularized Landweber method, Methods for computing weighted pseudoinverses and weighted normal pseudosolutions with singular weights, A generalized iterative method and comparison results using projection techniques for solving linear systems, Weighted Generalized Inverses, Oblique Projections, and Least-Squares Problems, Notes on flexible sequential block iterative methods, Landweber scheme for compact operator equation in Hilbert space and its applications, Convergence of string-averaging method for a class of operators, Computationally Efficient Decompositions of Oblique Projection Matrices, Kaczmarz method with oblique projection, Convergence analysis of SART: optimization and statistics, An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
