Tseng Type Methods for Inclusion and Fixed Point Problems with Applications
Keyword(s):
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.
2015 ◽
Vol 39
(2)
◽
pp. 773-793
◽
2008 ◽
Vol 43
(4)
◽
pp. 487-502
◽
2009 ◽
Vol 13
(5)
◽
pp. 1497-1513
◽
2007 ◽
Vol 14
(4)
◽
pp. 405-420
◽
2007 ◽
Vol 331
(1)
◽
pp. 506-515
◽
2016 ◽
Vol 19
(2)
◽
pp. 1481-1499
◽