摘要
This paper discusses the problem of finding the minimum-norm solution of the split feasibility problem (SFP). Using the idea of Tikhonov's regularization, we first introduce a unconstrained optimization problem related to the SFP. Then, we design and analyze a gradient algorithm for finding the minimum-norm solution of the SFP. The global convergence of the algorithm is also established.
- 出版日期2017-4
- 单位曲阜师范大学