On an open question of Moudafi for convex feasibility problems in Hilbert spaces
From MaRDI portal
Publication:514673
Recommendations
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Alternating CQ-algorithms for convex feasibility and split fixed-point problems
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Quasi-nonexpansivity and the convex feasibility problem
- On convex feasibility problems
Cites work
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Alternating proximal algorithms for weakly coupled convex minimization problems. Applications to dynamical games and PDE's
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
Cited in
(5)- Moudafi's open question and simultaneous iterative algorithm for general split equality variational inclusion problems and general split equality optimization problems
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- The strongly convergent relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms
This page was built for publication: On an open question of Moudafi for convex feasibility problems in Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514673)
