Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
From MaRDI portal
Publication:6046874
DOI10.1007/s12190-023-01875-7MaRDI QIDQ6046874
Xiaolei Tong, Tong Ling, Luo Yi Shi
Publication date: 6 October 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Inverse problems in optimal control (49N45)
Cites Work
- Solving the variational inequality problem defined on intersection of finite level sets
- Implicit and explicit algorithms for solving the split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- General splitting methods with linearization for the split feasibility problem
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- New inertial relaxed method for solving split feasibilities
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- 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
- Double projection algorithms for solving the split feasibility problems
- Inertial accelerated algorithms for solving a split feasibility problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- 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 relaxed CQ algorithm solving the split feasibility problem
- Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications