A New CQ Algorithm for Solving Split Feasibility Problems in Hilbert Spaces
© 2018, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia. 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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Journal |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85069661868&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/65672 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |