Some Explicit and Hybrid Strong Convergence Algorithms for Solving the Multiple-Sets Split Feasibility Problem


In this paper, we present several explicit and hybrid strong convergence algorithms for solving the multiple-sets split feasibility problem (MSSFP). Firstly, we modify the existing successive, parallel and cyclic algorithms with the hybrid steepest descent method; then two new hybrid formulas based on the Mann type method are presented; Two general hybrid… (More)

1 Figure or Table


  • Presentations referencing similar topics