Multi-step iterative algorithms with regularization for triple hierarchical variational inequalities with constraints of mixed equilibria, variational inclusions, and convex minimization

In this paper, we introduce and analyze a relaxed iterative algorithm by virtue of Korpelevich's extragradient method, the viscosity approximation method, the hybrid steepest-descent method, the regularization method, and the averaged mapping approach to the gradient-projection algorithm. It is proven that under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs), the solution set of finitely many variational inclusions and the set of minimizers of convex minimization problem (CMP), which is just a unique solution of a triple hierarchical variational inequality (THVI) in a real Hilbert space. In addition, we also consider the application of the proposed algorithm to solving a hierarchical fixed point problem with constraints of finitely many GMEPs, finitely many variational inclusions, and CMP. The results obtained in this paper improve and extend the corresponding results announced by many others.