A new relaxed projection method to solve the multiple-sets split feasibility problem
From MaRDI portal
Publication:4642890
zbMATH Open1399.90262MaRDI QIDQ4642890FDOQ4642890
Authors: Er Xu, Yanjun Zhang, Jinling Zhao 
Publication date: 25 May 2018
Recommendations
- A simple projection method for solving the multiple-sets split feasibility problem
- On two projection algorithms for the multiple-sets split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
- An improved method for solving multiple-sets split feasibility problem
Cited In (11)
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
- A hybrid projection method for solving the multiple-sets split feasibility problem
- A new halfspace-relaxation projection method for the split feasibility problem
- Remark on the Successive Projection Algorithm for the Multiple-Sets Split Feasibility Problem
- A simple projection method for solving the multiple-sets split feasibility problem
- A relaxed self-adaptive projection algorithm for solving the multiple-sets split equality problem
- A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem
- An improved method for solving multiple-sets split feasibility problem
This page was built for publication: A new relaxed projection method to solve the multiple-sets split feasibility problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642890)
