Hybrid steepest iterative algorithm for a hierarchical fixed point problem

Abstract

The purpose of this work is to introduce and study an iterative method to approximate solutions of a hierarchical fixed point problem and a variational inequality problem involving a finite family of nonexpansive mappings on a real Hilbert space. Further, we prove that the sequence generated by the proposed iterative method converges to a solution of the hierarchical fixed point problem for a finite family of nonexpansive mappings which is the unique solution of the variational inequality problem. The results presented in this paper are the extension and generalization of some previously known results in this area. An example which satisfies all the conditions of the iterative method and the convergence result is given. MSC: 49J30; 49J40; 47H09; 47J20

A hybrid iterative algorithm for a split mixed equilibrium problem and a hierarchical fixed point problem

“…For solving a convex minimization problem, hybrid iterative methods are in the spotlight of optimization theory; see [1,10,11,12,13,14,16,19,20] and the references therein. In 2001, Yamada [23] considered the following hybrid steepest-descent iterative method:…”