| Title |
New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
|
|---|---|
| Published in |
Journal of Inequalities and Applications, June 2017
|
| DOI | 10.1186/s13660-017-1409-9 |
| Pubmed ID | |
| Authors |
Peiyuan Wang, Jianjun Zhou, Risheng Wang, Jie Chen |
| Abstract |
Variable stepsize methods are effective for various modified CQ algorithms to solve the split feasibility problem (SFP). The purpose of this paper is first to introduce two new simpler variable stepsizes of the CQ algorithm. Then two new generalized variable stepsizes which can cover the former ones are also proposed in real Hilbert spaces. And then, two more general KM (Krasnosel'skii-Mann)-CQ algorithms are also presented. Several weak and strong convergence properties are established. Moreover, some numerical experiments have been taken to illustrate the performance of the proposed stepsizes and algorithms. |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 4 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Student > Ph. D. Student | 1 | 25% |
| Student > Bachelor | 1 | 25% |
| Unknown | 2 | 50% |
| Readers by discipline | Count | As % |
|---|---|---|
| Physics and Astronomy | 1 | 25% |
| Unknown | 3 | 75% |