The split feasibility problem and its solution algorithm
From MaRDI portal
Publication:1720866
DOI10.1155/2018/4123168zbMath1427.90221OpenAlexW2783623994MaRDI QIDQ1720866
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/4123168
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical linear algebra (65F99)
Related Items (2)
Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces ⋮ A Strong Convergence Theorem for Solving the Split Equality Fixed Point Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong convergence of a three-step algorithm for the split feasibility problem
- Convergence theorems for inertial KM-type algorithms
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of the gradient projection method for generalized convex minimization
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- Analysis on Newton projection method for the split feasibility problem
- Modified projection methods for the split feasibility problem and the multiple-sets split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- 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
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
This page was built for publication: The split feasibility problem and its solution algorithm
