Photo by averymeeker from unsplash
In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed… Click to show full abstract
In this paper, we propose a CQ-type algorithm for solving the split feasibility problem (SFP) in real Hilbert spaces. The algorithm is designed such that the step-sizes are directly computed at each iteration. We will show that the sequence generated by the proposed algorithm converges in norm to the minimum-norm solution of the SFP under appropriate conditions. In addition, we give some numerical examples to verify the implementation of our method. Our result improves and complements many known related results in the literature.
Journal Title: Bulletin of the Malaysian Mathematical Sciences Society
Year Published: 2019
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!