The ball-relaxed gradient-projection algorithm for split feasibility problem
From MaRDI portal
Publication:2138186
DOI10.1155/2022/9991466zbMath1506.47109OpenAlexW4223576731MaRDI QIDQ2138186
Fugen Gao, Xiaochun Li, Xiao-Xiao Liu
Publication date: 11 May 2022
Published in: Journal of Function Spaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2022/9991466
Convex programming (90C25) Set-valued and variational analysis (49J53) Iterative procedures involving nonlinear operators (47J25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Cites Work
- Unnamed Item
- Iterative approximation of solutions for proximal split feasibility problems
- Extra-gradient methods for solving split feasibility and fixed point problems
- Averaged mappings and the gradient-projection algorithm
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A relaxed alternating CQ-algorithm for convex feasibility problems
- New inertial relaxed method for solving split feasibilities
- Convergence analysis for proximal split feasibility problems and fixed point problems
- Solving the split feasibility problem without prior knowledge of matrix norms
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Strong convergence result for proximal split feasibility problem in Hilbert spaces
- Strong convergence of two algorithms for the split feasibility problem in Banach spaces
- The ball-relaxed CQ algorithms for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces