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: Nguyen The Vinh, Prasit Cholamjiak, Suthep Suantai
格式: 雜誌
出版: 2019
主題:
在線閱讀:https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85069661868&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/65672
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Chiang Mai University

相似書籍