Ball-relaxed projection algorithms for multiple-sets split feasibility problem
From MaRDI portal
Recommendations
- The ball-relaxed CQ algorithms for the split feasibility problem
- Remark on the Successive Projection Algorithm for the Multiple-Sets Split Feasibility Problem
- A new relaxed projection method to solve the multiple-sets split feasibility problem
- The ball-relaxed gradient-projection algorithm for split feasibility problem
- A simple projection method for solving the multiple-sets split feasibility problem
Cites work
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A cyclic iterative method for solving multiple sets split feasibility problems in Banach spaces
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- A general algorithm for multiple-sets split feasibility problem involving resolvents and Bregman mappings
- A modified CQ algorithm for solving the multiple-sets split feasibility problem and the fixed point problem for nonexpansive mappings
- 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 relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems
- An implicit algorithm for the split common fixed point problem in Hilbert spaces and applications
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Averaged mappings and the gradient-projection algorithm
- Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
- Convergence of Mann's type iteration method for generalized asymptotically nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
- Fast Algorithms for Projection on an Ellipsoid
- Fixed point algorithms for split feasibility problems
- General method for solving the split common fixed point problem
- Generalized KM theorems and their applications
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- scientific article; zbMATH DE number 5624813 (Why is no real title available?)
- scientific article; zbMATH DE number 6847097 (Why is no real title available?)
- scientific article; zbMATH DE number 6761956 (Why is no real title available?)
- Implicit and explicit algorithms for solving the split feasibility problem
- Inertial accelerated algorithms for solving a split feasibility problem
- Inexact implicit methods for monotone general variational inequalities
- Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Iterative process for solving a multiple-set split feasibility problem
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On global convergence rate of two acceleration projection algorithms for solving the multiple-sets split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- On split common fixed point problems
- Parallel iterative methods for solving the split common fixed point problem in Hilbert spaces
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Relaxed two points projection method for solving the multiple-sets split equality problem
- Self-adaptive algorithms for the split problem of the demicontractive operators
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Several solution methods for the split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Splitting methods for split feasibility problems with application to Dantzig selectors
- Strong convergence for generalized multiple-set split feasibility problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Strong convergence of projected reflected gradient methods for variational inequalities
- Strong convergence theorem for multiple sets split feasibility problems in Banach spaces
- The ball-relaxed CQ algorithms for the split feasibility problem
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- The split common fixed-point problem for demicontractive mappings
- The strong convergence of a KM-CQ-like algorithm for a split feasibility problem
- Two projection algorithms for solving the split common fixed point problem
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
Cited in
(3)- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
- An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net
- A generalized scheme for split inclusion problem with conjugate like direction
This page was built for publication: Ball-relaxed projection algorithms for multiple-sets split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045171)
