An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
From MaRDI portal
Recommendations
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- A strongly convergent parallel projection algorithm for convex feasibility problem
- A parallel projection method based on sequential most remote set in convex feasibility problems
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
Cited in
(9)- Improving the speed of convergence in the method of projections onto convex sets
- An extrapolated parallel subgradient projection algorithm with centering technique for the convex feasibility problem
- Iterations of parallel convex projections in hilbert spaces
- Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters
- Solving stochastic convex feasibility problems in hilbert spaces
- Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
- The implicit convex feasibility problem and its application to adaptive image denoising
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- On convex feasibility problems
This page was built for publication: An Adaptive Parallel Projection Method for Solving Convex Feasibility Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4387581)