“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 16969
School of Mathematics
  Title:   A novel algorithm for approximating common solution of a system of monotone inclusion problem and common fixed point problem
  Author(s):  Mohammad Eslamian (Joint with A. Kamandi)
  Status:   To Appear
  Journal: Journal of Industrial and Management Optimization (JIMO)
  Supported by:  IPM
  Abstract:
In this paper, we study the problem of finding a common element of the set of solutions of a system of monotone inclusion problems and the set of common fixed points of a finite family of generalized demimetric mappings in Hilbert spaces. We propose a new and efficient algorithm for solving this problem. Our method relies on the inertial algorithm, Tseng’s splitting algorithm and the viscosity algorithm. Strong convergence analysis of the proposed method is established under standard and mild conditions. As applications we use our algorithm for finding the common solutions to variational inequality problems, the constrained multiple-set split convex feasibility problem, the convex minimization problem and the common minimizer problem. Finally, we give some numerical results to show that our proposed algorithm is efficient and implementable from the numerical point of view.

Download TeX format
back to top
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
Clients Logo
scroll left or right