Relaxed inertial accelerated algorithms for solving split equality feasibility problem
DOI10.22436/jnsa.010.08.07zbMath1412.47066OpenAlexW2743521362MaRDI QIDQ4632558
Meixia Li, Xiping Kao, Hai-Tao Che
Publication date: 30 April 2019
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.08.07
weak convergencesubdifferentialrelaxed inertial accelerated algorithmsplit equality feasibility problem
Numerical mathematical programming methods (65K05) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simultaneous iterative method for split equality problems of two finite
- Split equality fixed point problem for quasi-pseudo-contractive mappings with applications
- Convergence theorems for inertial KM-type algorithms
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A multiprojection algorithm using Bregman projections in a product space
- Inertial accelerated algorithms for solving a split feasibility problem
- Robust solutions of split feasibility problem with uncertain linear operator
- A new halfspace-relaxation projection method for the split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Optimization and nonsmooth analysis
- A relaxed projection method for variational inequalities
- Some problems and results in the study of nonlinear analysis
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- Minimization of unsmooth functionals
- Several solution methods for the split feasibility problem
This page was built for publication: Relaxed inertial accelerated algorithms for solving split equality feasibility problem