Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
From MaRDI portal
Recommendations
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- A strongly convergent parallel projection algorithm for convex feasibility problem
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- A parallel subgradient projections method for the convex feasibility problem
Cites work
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- scientific article; zbMATH DE number 3511879 (Why is no real title available?)
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- A computational solution of the inverse problem in radiation-therapy treatment planning
- A method of iterative data refinement and its applications
- A simultaneous projections method for linear inequalities
- An interior points algorithm for the convex feasibility problem
- Block-iterative methods for consistent and inconsistent linear equations
- Convergence of the cyclical relaxation method for linear inequalities
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- New methods for linear inequalities
- On Block-Iterative Entropy Maximization
- On a relaxation method of solving systems of linear inequalities
- On some optimization techniques in image reconstruction from projections
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- State-of-the-art in parallel nonlinear optimization
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The method of projections for finding the common point of convex sets
Cited in
(77)- XCT image reconstruction by a modified superiorized iteration and theoretical analysis
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- Convex feasibility modeling and projection methods for sparse signal recovery
- Convergence theorems of convex combination methods for treating \(d\)-accretive mappings in a Banach space and nonlinear equation
- Randomized Kaczmarz with averaging
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- Parallel methods in image recovery by projections onto convex sets
- Projected subgradient minimization versus superiorization
- Block-iterative schemes for the split common fixed point problem and applications
- From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convergence of string-averaging method for a class of operators
- Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- A decomposition method for a class of convex generalized Nash equilibrium problems
- A projection method for semidefinite linear systems and its applications
- scientific article; zbMATH DE number 3912113 (Why is no real title available?)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Hilbertian convex feasibility problem: Convergence of projection methods
- Projection algorithms for convex feasibility problem
- A parallel projection method based on sequential most remote set in convex feasibility problems
- The Reflection Method for the Numerical Solution of Linear Systems
- Feasibility-based fixed point networks
- Extrapolated simultaneous block‐iterative cutter methods and applications
- The implicit convex feasibility problem and its application to adaptive image denoising
- Relaxed outer projections, weighted averages and convex feasibility
- String-averaging projected subgradient methods for constrained minimization
- Iterative methods for parallel convex optimization with fixed point constraints
- Greed Works: An Improved Analysis of Sampling Kaczmarz--Motzkin
- A parallel subgradient projections method for the convex feasibility problem
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- "A visual and numerical comparative study of some parallel affine projection algorithms for solving the convex feasibility problem with application to scratch inpainting"
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Extensions of block-projections methods with relaxation parameters to inconsistent and rank-deficient least-squares problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- Convergence and semi-convergence of a class of constrained block iterative methods
- Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces
- A real-time iterative projection scheme for solving the common fixed point problem and its applications
- On the string averaging method for sparse common fixed-point problems
- Opial-type theorems and the common fixed point problem
- Perturbation-resilient iterative methods with an infinite pool of mappings
- The method of alternating relaxed projections for two nonconvex sets
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- A method for approximating the solution set of a system of convex inequalities by polytopes
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- Distributed optimization for degenerate loss functions arising from over-parameterization
- Steered sequential projections for the inconsistent convex feasibility problem
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Iterations of parallel convex projections in hilbert spaces
- Choosing the relaxation parameter in sequential block-iterative methods for linear systems
- Accelerated under-relaxed parallel projection algorithms for convex set theoretic image recovery problem
- A BLOCK-PARALLEL CONJUGATE GRADIENT METHOD FOR SEPARABLE QUADRATIC PROGRAMMING PROBLEMS^1
- New Douglas-Rachford algorithmic structures and their convergence analyses
- Total variation superiorization in dual-energy CT reconstruction for proton therapy treatment planning
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- A convergence result on random products of mappings in metric spaces
- A convergence result on random products of mappings in metric trees
- Strong convergence of expected-projection methods in hilbert spaces
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Convergence analysis for column-action methods in image reconstruction
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Block-iterative surrogate projection methods for convex feasibility problems
- Parallel application of block-iterative methods in medical imaging and radiation therapy
This page was built for publication: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822907)
