The modified inertial relaxed CQ algorithm for solving the split feasibility problems
© 2018 American Institute of Mathematical Sciences. In this work, we propose a new version of inertial relaxed CQ algorithms for solving the split feasibility problems in the frameworks of Hilbert spaces. We then prove its strong convergence by using a viscosity approximation method under some weake...
Saved in:
| Main Authors: | , , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85054989308&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62603 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
th-cmuir.6653943832-62603 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-626032018-11-29T07:47:57Z The modified inertial relaxed CQ algorithm for solving the split feasibility problems Suthep Suantai Nattawut Pholasa Prasit Cholamjiak Business, Management and Accounting Mathematics © 2018 American Institute of Mathematical Sciences. In this work, we propose a new version of inertial relaxed CQ algorithms for solving the split feasibility problems in the frameworks of Hilbert spaces. We then prove its strong convergence by using a viscosity approximation method under some weakened assumptions. To be more precisely, the computation on the norm of operators and the metric projections is relaxed. Finally, we provide numerical experiments to illustrate the convergence behavior and to show the effectiveness of the sequences constructed by the inertial technique. 2018-11-29T07:34:57Z 2018-11-29T07:34:57Z 2018-10-01 Journal 1553166X 15475816 2-s2.0-85054989308 10.3934/jimo.2018023 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85054989308&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62603 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Business, Management and Accounting Mathematics |
| spellingShingle |
Business, Management and Accounting Mathematics Suthep Suantai Nattawut Pholasa Prasit Cholamjiak The modified inertial relaxed CQ algorithm for solving the split feasibility problems |
| description |
© 2018 American Institute of Mathematical Sciences. In this work, we propose a new version of inertial relaxed CQ algorithms for solving the split feasibility problems in the frameworks of Hilbert spaces. We then prove its strong convergence by using a viscosity approximation method under some weakened assumptions. To be more precisely, the computation on the norm of operators and the metric projections is relaxed. Finally, we provide numerical experiments to illustrate the convergence behavior and to show the effectiveness of the sequences constructed by the inertial technique. |
| format |
Journal |
| author |
Suthep Suantai Nattawut Pholasa Prasit Cholamjiak |
| author_facet |
Suthep Suantai Nattawut Pholasa Prasit Cholamjiak |
| author_sort |
Suthep Suantai |
| title |
The modified inertial relaxed CQ algorithm for solving the split feasibility problems |
| title_short |
The modified inertial relaxed CQ algorithm for solving the split feasibility problems |
| title_full |
The modified inertial relaxed CQ algorithm for solving the split feasibility problems |
| title_fullStr |
The modified inertial relaxed CQ algorithm for solving the split feasibility problems |
| title_full_unstemmed |
The modified inertial relaxed CQ algorithm for solving the split feasibility problems |
| title_sort |
modified inertial relaxed cq algorithm for solving the split feasibility problems |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85054989308&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62603 |
| _version_ |
1681425837975404544 |