Tseng type methods for inclusion and fixed point problems with applications
© 2019 by the authors. An algorithm is introduced to find an answer to both inclusion problems and fixed point problems. This algorithm is a modification of Tseng type methods inspired by Mann's type iteration and viscosity approximation methods. On certain conditions, the iteration obtained fr...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | 雜誌 |
| 出版: |
2020
|
| 主題: | |
| 在線閱讀: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079597922&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67891 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | © 2019 by the authors. An algorithm is introduced to find an answer to both inclusion problems and fixed point problems. This algorithm is a modification of Tseng type methods inspired by Mann's type iteration and viscosity approximation methods. On certain conditions, the iteration obtained from the algorithm converges strongly. Moreover, applications to the convex feasibility problem and the signal recovery in compressed sensing are considered. Especially, some numerical experiments of the algorithm are demonstrated. These results are compared to those of the previous algorithm. |
|---|