Block-iterative projection methods for parallel computation of solutions to convex feasibility problems

DOI10.1016/0024-3795(89)90375-3zbMath0679.65046OpenAlexW2025424390MaRDI QIDQ1822907

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90375-3

zbMATH Keywords

convergence parallel implementation image restoration convex feasibility problem image reconstruction from projections block-iterative schemes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Mathematical programming (90C99)

Related Items

A decomposition method for a class of convex generalized Nash equilibrium problems, Opial-Type Theorems and the Common Fixed Point Problem, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, A projection method for semidefinite linear systems and its applications, Steered sequential projections for the inconsistent convex feasibility problem, Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces, Feasibility-based fixed point networks, Improved constraint consensus methods for seeking feasibility in nonlinear programs, Block-iterative surrogate projection methods for convex feasibility problems, An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces, A parallel projection method based on sequential most remote set in convex feasibility problems, Parallel application of block-iterative methods in medical imaging and radiation therapy, Iterations of parallel convex projections in hilbert spaces, A real-time iterative projection scheme for solving the common fixed point problem and its applications, Randomized Kaczmarz with averaging, A convergence result on random products of mappings in metric spaces, A convergence result on random products of mappings in metric trees, On the behavior of a block-iterative projection method for solving convex feasibility problems, Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems, Strong convergence of expected-projection methods in hilbert spaces, Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings, A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators, Total variation superiorization in dual-energy CT reconstruction for proton therapy treatment planning, The Reflection Method for the Numerical Solution of Linear Systems, Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, Convergence and perturbation resilience of dynamic string-averaging projection methods, Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces, Extrapolated simultaneous block‐iterative cutter methods and applications, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Paved with good intentions: analysis of a randomized block Kaczmarz method, Convex feasibility modeling and projection methods for sparse signal recovery, Unnamed Item, Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters, Choosing the relaxation parameter in sequential block-iterativemethods for linear systems, The method of alternating relaxed projections for two nonconvex sets, A method for approximating the solution set of a system of convex inequalities by polytopes, Regular Sequences of Quasi-Nonexpansive Operators and Their Applications, Hilbertian convex feasibility problem: Convergence of projection methods, On the string averaging method for sparse common fixed‐point problems, Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections, Convergence analysis for column-action methods in image reconstruction, Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces, Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems, Projected subgradient minimization versus superiorization, A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, String-averaging projected subgradient methods for constrained minimization, New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Relaxed outer projections, weighted averages and convex feasibility, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Distributed optimization for degenerate loss functions arising from over-parameterization, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, Convergence of string-averaging method for a class of operators, Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin, A generalized block-iterative projection method for the common fixed point problem induced by cutters, XCT image reconstruction by a modified superiorized iteration and theoretical analysis, Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods, The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods, Convergence theorems of convex combination methods for treating \(d\)-accretive mappings in a Banach space and nonlinear equation, A class of optimized row projection methods for solving large nonsymmetric linear systems

Cites Work