Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
DOI10.1007/S12190-023-01875-7MaRDI QIDQ6046874FDOQ6046874
Authors: Tong Ling, Xiaolei Tong, Luoyi Shi
Publication date: 6 October 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Recommendations
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Improved relaxed CQ methods for solving the split feasibility problem
- Note on the modified relaxation CQ algorithm for the split feasibility problem
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Iterative procedures involving nonlinear operators (47J25) Inverse problems in optimal control (49N45) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- Convex analysis and monotone operator theory in Hilbert spaces
- A multiprojection algorithm using Bregman projections in a product space
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The multiple-sets split feasibility problem and its applications for inverse problems
- Iterative oblique projection onto convex sets and the split feasibility problem
- Implicit and explicit algorithms for solving the split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Solving the variational inequality problem defined on intersection of finite level sets
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- The relaxed CQ algorithm solving the split feasibility problem
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Polyak's gradient method for split feasibility problem constrained by level sets
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- New inertial relaxed method for solving split feasibilities
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- Inertial accelerated algorithms for solving a split feasibility problem
- Global and linear convergence of alternated inertial methods for split feasibility problems
- General splitting methods with linearization for the split feasibility problem
- Double projection algorithms for solving the split feasibility problems
- New inertial relaxed \(CQ\) algorithms for solving split feasibility problems in Hilbert spaces
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
Cited In (6)
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Title not available (Why is that?)
- Improved relaxed CQ methods for solving the split feasibility problem
- Some novel inertial ball-relaxed CQ algorithms for solving the split feasibility problem with multiple output sets
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Title not available (Why is that?)
This page was built for publication: Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046874)