Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces
DOI10.1186/s13660-019-2026-6zbMath1499.90273OpenAlexW2939133967WikidataQ128144427 ScholiaQ128144427MaRDI QIDQ2067802
Tingting Tian, Luo Yi Shi, Ru Dong Chen
Publication date: 19 January 2022
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-019-2026-6
linear convergencesplit equality problembounded linear regularityrelaxed gradient projection algorithm
Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with nonlinear operators (65J15) Methods of reduced gradient type (90C52)
Related Items (3)
Cites Work
- Strong convergence of an extragradient-type algorithm for the multiple-sets split equality problem
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Strong convergence of iterative algorithms for the split equality problem
- Solving the split equality problem without prior knowledge of operator norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- Linear convergence of gradient projection algorithm for split equality problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
This page was built for publication: Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces