On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
From MaRDI portal
Publication:2189407
A certain algorithm is developed for solving the split feasibility problem by using variable stepsizes. A convergence analysis of the algorithm is provided. Numerical experiments demonstrate that the new algorithm outperforms earlier ones using similar information.
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
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A note on the CQ algorithm for the split feasibility problem
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- 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
- Convex analysis and monotone operator theory in Hilbert spaces
- Fixed points of nonexpanding maps
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- On the convergence of CQ algorithm with variable steps for the split equality problem
- On variable-step relaxed projection algorithm for variational inequalities
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- Solving the variational inequality problem defined on intersection of finite level sets
- The relaxed CQ algorithm solving the split feasibility problem
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
Cited in
(46)- The split feasibility problem and its solution algorithm
- 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
- 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
- Linear approximation method for solving split inverse problems and its applications
- 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
- New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- Relaxed successive projection algorithm with strong convergence for the multiple-sets split equality problem
- A new iterative scheme using inertial technique for the split feasibility problem with application to compressed sensing
- Inertial relaxed CQ algorithm with an application to signal processing
- Numerical reckoning fixed points for nonexpansive mappings via a faster iteration process and its application to constrained minimization problems, split feasibility problems and image deblurring problems
- A novel relaxed projective method for split feasibility problems
- Strong convergence of the inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces
- Spectral conjugate gradient like method for signal reconstruction
- Hybrid algorithm for system of nonlinear monotone equations based on the convex combination of Fletcher-Reeves and a new conjugate residual parameters
- An unconstrained optimization approach to the split feasibility problem
- A double projection algorithm with inertial effects for solving split feasibility problems and applications to image restoration
- New self-adaptive algorithms and inertial self-adaptive algorithms for the split variational inclusion problems in Hilbert space
- Convergence rate of the CQ algorithm for split feasibility problems
- On the convergence of CQ algorithm with variable steps for the split equality problem
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- 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
- Convergence analysis for solving the split equality equilibrium problem in Hilbert spaces
- 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
- A note on the general split common fixed point problem in Hilbert spaces
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- An algorithm to solve the variational inequality problem based on the common solutions of two classes of problems
- An inertial hyperplane projection method for split feasibility problems and applications
- Several relaxed CQ-algorithms for the split feasibility problem with multiple output sets
- Self-adaptive CQ-type algorithms for the split feasibility problem involving two bounded linear operators in Hilbert spaces
- Research on a strong convergence theorem for proximal split feasibility problems with non-Lipschitz stepsizes
- Split equality equilibrium problem with multivalued strictly pseudocontractive mappings in Hilbert spaces
- A new approximation scheme for solving various split inverse problems
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)
