On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem

DOI10.1007/s11075-019-00790-yzbMath1459.65073OpenAlexW2967986731WikidataQ127339857 ScholiaQ127339857MaRDI QIDQ2189407

Prasit Cholamjiak, Nattawut Pholasa, Suparat Kesornprom

Publication date: 15 June 2020

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-019-00790-y

zbMATH Keywords

Hilbert spacegradient methodsplit feasibility problemCQ algorithm

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (28)

A new approximation scheme for solving various split inverse problems ⋮ An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces ⋮ A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration ⋮ An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces ⋮ Linear approximation method for solving split inverse problems and its applications ⋮ New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space ⋮ Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem ⋮ A general alternative regularization method with line search technique for solving split equilibrium and fixed point problems in Hilbert spaces ⋮ Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators ⋮ Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications ⋮ Two inertial-type algorithms for solving the split feasibility problem ⋮ A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ A novel iterative scheme for solving delay differential equations and nonlinear integral equations in Banach spaces ⋮ A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new linesearch iterative scheme for finding a common solution of split equilibrium and fixed point problems ⋮ Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces ⋮ Modified viscosity implicit rules for proximal split feasibility and fixed point problems ⋮ Strong convergence of alternated inertial \(CQ\) relaxed method with application in signal recovery ⋮ The iterative method for solving the proximal split feasibility problem with an application to LASSO problem ⋮ Shrinking Cesàro means method for the split equilibrium and fixed point problems in Hilbert spaces

Cites Work

• Solving the variational inequality problem defined on intersection of finite level sets
• On the convergence of CQ algorithm with variable steps for the split equality problem
• Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
• A multiprojection algorithm using Bregman projections in a product space
• On variable-step relaxed projection algorithm for variational inequalities
• Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• 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
• The relaxed CQ algorithm solving the split feasibility problem
• Fixed points of nonexpanding maps
• A note on the CQ algorithm for the split feasibility problem
• A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem