scholarly journals Tseng Type Methods for Inclusion and Fixed Point Problems with Applications

Mathematics ◽  
2019 ◽  
Vol 7 (12) ◽  
pp. 1175 ◽  
Author(s):  
Raweerote Suparatulatorn ◽  
Anchalee Khemphet

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.

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 236 ◽  
Author(s):  
Bing Tan ◽  
Shanshan Xu ◽  
Songxiao Li

In this paper, we introduce two modified inertial hybrid and shrinking projection algorithms for solving fixed point problems by combining the modified inertial Mann algorithm with the projection algorithm. We establish strong convergence theorems under certain suitable conditions. Finally, our algorithms are applied to convex feasibility problem, variational inequality problem, and location theory. The algorithms and results presented in this paper can summarize and unify corresponding results previously known in this field.


2014 ◽  
Vol 2014 ◽  
pp. 1-15
Author(s):  
Lu-Chuan Ceng ◽  
Ching-Feng Wen ◽  
Chin-Tzong Pang

We propose some relaxed implicit and explicit viscosity approximation methods for hierarchical fixed point problems for a countable family of nonexpansive mappings in uniformly smooth Banach spaces. These relaxed viscosity approximation methods are based on the well-known viscosity approximation method and hybrid steepest-descent method. We obtain some strong convergence theorems under mild conditions.


Sign in / Sign up

Export Citation Format

Share Document