Block methods for a convex feasibility problem in a Banach space
From MaRDI portal
Recommendations
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Modified block iterative algorithm for solving convex feasibility problems in Banach spaces
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- scientific article; zbMATH DE number 4009672
- A new method for solving convex feasibility problem in Banach spaces
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- Block-iterative surrogate projection methods for convex feasibility problems
- Iterative approaches to convex feasibility problems in Banach spaces
- Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces
- Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces
Cited in
(5)- A block hybrid method for solving generalized equilibrium problems and convex feasibility problem
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- A new method for solving convex feasibility problem in Banach spaces
- scientific article; zbMATH DE number 4031405 (Why is no real title available?)
- Modified block iterative algorithm for solving convex feasibility problems in Banach spaces
This page was built for publication: Block methods for a convex feasibility problem in a Banach space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827903)