An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem
DOI10.1007/s43034-022-00190-9OpenAlexW4283169787WikidataQ114216211 ScholiaQ114216211MaRDI QIDQ2150319
Guash Haile Taddele, Poom Kumam, Vasile Berinde
Publication date: 27 June 2022
Published in: Annals of Functional Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43034-022-00190-9
strong convergenceLipschitz continuityballsplit feasibility problemmultiple-sets split feasibility problemself-adaptive technique
Numerical mathematical programming methods (65K05) Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Operations research, economics (aspects of mathematics education) (97M40)
Cites Work
- Unnamed Item
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Iterative methods for fixed point problems in Hilbert spaces
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- An inertial forward-backward algorithm for monotone inclusions
- Perturbation techniques for nonexpansive mappings with applications
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Convergence of a splitting inertial proximal method for monotone operators
- A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- An inertial extrapolation method for multiple-set split feasibility problem
- Multiple-sets split feasibility problem and split equality fixed point problem for firmly quasi-nonexpansive or nonexpansive mappings
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- A new iterative algorithm for the multiple-sets split feasibility problem and the split equality fixed point problem
- New iterative regularization methods for the multiple-sets split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- Strong convergence of a self-adaptive method for the split feasibility problem
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces
- Iterative regularization methods for the multiple-sets split feasibility problem in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Inertial accelerated algorithms for solving a split feasibility problem
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Strong Convergence Theorem for Multiple Sets Split Feasibility Problems in Banach Spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- 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 ball-relaxed CQ algorithms for the split feasibility problem
- The relaxed CQ algorithm solving the split feasibility problem
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- Gradient methods with selection technique for the multiple-sets split feasibility problem
- Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Fast Algorithms for Projection on an Ellipsoid
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem