Abstract

The multiple-sets split feasibility problem (MSSFP) has a variety of applications in the real world such as medical care, image reconstruction and signal processing. Censor et al. proposed solving the MSSFP by a proximity function, and then developed a class of simultaneous methods for solving split feasibility. In our paper, we improve a simultaneous method for solving the MSSFP and prove its convergence.

Highlights

  • Throughout this paper, let H be a Hilbert space, ·, · denote the inner product and · denote the corresponding norm

  • Where A is a matrix of M ×N, and t, r > are integers

  • Definition Let F be a mapping from S ⊆ Rn into Rn, (a) F is called monotone on S if

Read more

Summary

Introduction

Throughout this paper, let H be a Hilbert space, ·, · denote the inner product and · denote the corresponding norm. Let Ci and Qj be closed convex sets in the N -dimensional and M-dimensional Euclidean spaces, respectively.

Results
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call