Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
From MaRDI portal
Recommendations
- An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
- A strongly convergent parallel projection algorithm for convex feasibility problem
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
- A parallel subgradient projections method for the convex feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- scientific article; zbMATH DE number 2227334
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- Projection algorithms for convex feasibility problem
- A parallel approximate subgradient projection algorithm for convex feasibility problem
Cites work
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Decomposition through formalization in a product space
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- The method of projections for finding the common point of convex sets
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- Weak and norm convergence of a parallel projection method in Hilbert spaces
Cited in
(12)- A parallel projection method based on sequential most remote set in convex feasibility problems
- From parallel to sequential projection methods and vice versa in convex feasibility: Results and conjectures.
- Cases of ineffectiveness of geometric cuts in sequential projection methods
- The relation between the weight factor and the number of steps in a projection algorithm
- scientific article; zbMATH DE number 3973706 (Why is no real title available?)
- An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
- scientific article; zbMATH DE number 1174427 (Why is no real title available?)
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- Finding projections onto the intersection of convex sets in hilbert spaces
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
This page was built for publication: Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4351445)
