The ball-relaxed CQ algorithms for the split feasibility problem
From MaRDI portal
Recommendations
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- Improved relaxed CQ methods for solving the split feasibility problem
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Extensions of the CQ algorithm for the split feasibility and split equality problems
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Two strongly convergent CQ algorithms for split feasibility problem
Cites work
- A multiprojection algorithm using Bregman projections in a product space
- A new halfspace-relaxation projection method for the split feasibility problem
- A new method for split common fixed-point problem without priori knowledge of operator norms
- A note on the CQ algorithm for the split feasibility problem
- A relaxed alternating CQ-algorithm for convex feasibility problems
- A relaxed projection method for variational inequalities
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- Convex analysis and monotone operator theory in Hilbert spaces
- Fast Algorithms for Projection on an Ellipsoid
- Inexact implicit methods for monotone general variational inequalities
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of CQ algorithm with variable steps for the split equality problem
- On variable-step relaxed projection algorithm for variational inequalities
- Polyak's gradient method for split feasibility problem constrained by level sets
- Regularization and Variable Selection Via the Elastic Net
- Solving the split feasibility problem without prior knowledge of matrix norms
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
Cited in
(28)- Strong convergence on the split feasibility problem by mixing W-mapping
- New inertial relaxed method for solving split feasibilities
- Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces
- The ball-relaxed gradient-projection algorithm for split feasibility problem
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- Linear approximation method for solving split inverse problems and its applications
- Global and linear convergence of alternated inertial methods for split feasibility problems
- Generalized Halpern iteration with new control conditions and its application
- Improved relaxed CQ methods for solving the split feasibility problem
- A splitting-relaxed projection method for solving the split feasibility problem
- Extensions of the CQ algorithm for the split feasibility and split equality problems
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- An inertial relaxed CQ algorithm with an application to the LASSO and elastic net
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- Strongly convergent ball-relaxed CQ algorithm and its application
- An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
- A new relaxed method for the split feasibility problem in Hilbert spaces
- Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
- On inertial non-Lipschitz stepsize algorithms for split feasibility problems
- A moving ball projection algorithm for the split feasibility problem
- CQ algorithm with inertial and correction terms for split feasibility problems
- Prediction of Breast Cancer through Fast Optimization Techniques Applied to Machine Learning
- A novel relaxed method for the split feasibility problem in Hilbert spaces
- Algorithms and applications for split equality problem with related problems
- Relaxed self-adaptive alternating inertial algorithm for solving variational inequalities with the multiple-sets split feasibility problem with multiple output sets constraint
- A new relaxed projection method for solving the split feasibility problem with multiple output sets
- An accelerated relaxed algorithm for the split feasibility problem with multiple output sets in Hilbert spaces
This page was built for publication: The ball-relaxed 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 Q4646524)
