On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
DOI10.1007/S11075-019-00790-YzbMATH Open1459.65073OpenAlexW2967986731WikidataQ127339857 ScholiaQ127339857MaRDI QIDQ2189407FDOQ2189407
Authors: Suparat Kesornprom, Nattawut Pholasa, Prasit Cholamjiak
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
Recommendations
- Convergence rate of the CQ algorithm for split feasibility problems
- Convergence of the modified CQ algorithm and its application in split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Two strongly convergent CQ algorithms for split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Convergence analysis of a novel iteration algorithm for solving split feasibility problems
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- Alternating CQ-algorithms for convex feasibility and split fixed-point problems
- Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- Convex analysis and monotone operator theory in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Fixed points of nonexpanding maps
- On variable-step relaxed projection algorithm for variational inequalities
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- 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
- Solving the variational inequality problem defined on intersection of finite level sets
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- 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
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
Cited In (34)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shrinking Cesàro means method for the split equilibrium and fixed point problems in Hilbert spaces
- A new approximation scheme for solving various split inverse problems
- Title not available (Why is that?)
- A novel iterative scheme for solving delay differential equations and nonlinear integral equations in Banach spaces
- New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space
- A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem
- Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems
- Two new inertial relaxed gradient CQ algorithms on the split equality problem
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Linear approximation method for solving split inverse problems and its applications
- 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
- Title not available (Why is that?)
- A note on the general split common fixed point problem in Hilbert spaces
- Title not available (Why is that?)
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- An inertial self-adaptive algorithm for the generalized split common null point problem in Hilbert spaces
- A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- A general alternative regularization method with line search technique for solving split equilibrium and fixed point problems in Hilbert spaces
- A new linesearch iterative scheme for finding a common solution of split equilibrium and fixed point problems
- An algorithm to solve the variational inequality problem based on the common solutions of two classes of problems
- A novel projection method for split feasibility problems with applications to compressive sensing
- Modified viscosity implicit rules for proximal split feasibility and fixed point problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Convergence analysis for solving the split equality equilibrium problem in Hilbert spaces
- A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration
- Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem
This page was built for publication: On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189407)