Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
From MaRDI portal
Publication:2061472
DOI10.1186/s13660-018-1933-2zbMath1485.47113OpenAlexW2905489099WikidataQ60305588 ScholiaQ60305588MaRDI QIDQ2061472
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1933-2
strong convergenceweak convergenceHilbert spacessplit equality problemsplit feasibility problemrelaxed alternating method
Iterative procedures involving nonlinear operators (47J25) Equations and inequalities involving linear operators, with vector unknowns (47A50) Inverse problems in optimal control (49N45)
Related Items
Internal perturbation projection algorithm for the extended split equality problem and the extended split equality fixed point problem ⋮ The Strongly Convergent Relaxed Alternating CQ Algorithms for the Split Equality Problem in Hilbert Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Hybrid simultaneous algorithms for the split equality problem with applications
- Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces
- On the convergence of CQ algorithm with variable steps for the split equality problem
- On an open question of Moudafi for convex feasibility problems in Hilbert spaces
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Properties and iterative methods for the lasso and its variants
- A multiprojection algorithm using Bregman projections in a product space
- On variable-step relaxed projection algorithm for variational inequalities
- Inexact implicit methods for monotone general variational inequalities
- A relaxed alternating CQ-algorithm for convex feasibility problems
- Strong convergence of iterative algorithms for the split equality problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- A new halfspace-relaxation projection method for the split feasibility problem
- Solving the split equality problem without prior knowledge of operator norms
- A new iterative method for the split common fixed point problem in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative Algorithms for Nonlinear Operators
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Self-adaptive algorithms for the split problem of the demicontractive operators
- The ball-relaxed CQ algorithms for the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
