A new iterative method with alternated inertia for the split feasibility problem
From MaRDI portal
Publication:5090003
DOI10.23952/jnva.5.2021.6.07OpenAlexW4241919750MaRDI QIDQ5090003
Lulu Liu, Qiao-Li Dong, L. L. Zhong, Dongli Zhang
Publication date: 15 July 2022
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.5.2021.6.07
Cites Work
- Iterative methods for fixed point problems in Hilbert spaces
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- General splitting methods with linearization for the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Global and linear convergence of alternated inertial methods for split feasibility problems
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A class of projection and contraction methods for monotone variational inequalities
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Solving the split feasibility problem without prior knowledge of matrix norms
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A monotone Bregan projection algorithm for fixed point and equilibrium problems in a reflexive Banach space
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
