On the convergence of CQ algorithm with variable steps for the split equality problem
From MaRDI portal
Publication:513675
DOI10.1007/s11075-016-0177-9zbMath1382.47035OpenAlexW2470963051MaRDI QIDQ513675
Publication date: 7 March 2017
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-016-0177-9
weak convergenceHilbert spacesvariable step-sizesplit equality problemsplit feasibility problemCQ algorithm
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Inverse problems in optimal control (49N45)
Related Items
An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ A new method for solving split equality problems via projection dynamical systems ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ A new method for split common fixed-point problem without priori knowledge of operator norms ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem ⋮ A new iterative method for the split common fixed point problem in Hilbert spaces ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The ball-relaxed CQ algorithms for the split feasibility problem ⋮ An iterative algorithm for solving split equilibrium problems and split equality variational inclusions for a class of nonexpansive-type maps ⋮ Unnamed Item ⋮ A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems ⋮ A strong convergence theorem for a parallel iterative method for solving the split common null point problem in Hilbert spaces ⋮ Iterative solutions of the split common fixed point problem for strictly pseudo-contractive mappings ⋮ New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces ⋮ Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces ⋮ Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems ⋮ Alternating iterative algorithms for the split equality problem without prior knowledge of operator norms ⋮ A new self-adaptive method for the split equality common fixed-point problem of quasi-nonexpansive mappings ⋮ An inertial relaxed CQ algorithm with an application to the LASSO and elastic net ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ An iterative algorithm for solving split equality fixed point problems for a class of nonexpansive-type mappings in Banach spaces ⋮ A self-adaptive iterative algorithm for the split common fixed point problems ⋮ The Strongly Convergent Relaxed Alternating CQ Algorithms for the Split Equality Problem in Hilbert Spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating fixed points of nonexpansive mappings by the Ishikawa iteration process
- A multiprojection algorithm using Bregman projections in a product space
- A strongly convergent algorithm for the split common fixed point problem
- On variable-step relaxed projection algorithm for variational inequalities
- A relaxed alternating CQ-algorithm for convex feasibility problems
- General method for solving the split common fixed point problem
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
