<p>In this paper, we present a novel algorithm designed to approximate a common solution for both a pseudomonotone equilibrium problem and the common fixed point problem associated with a finite family of generalized demimetric mappings within a real Hilbert space. Our proposed algorithm employs an inertial approach that integrates a correction term and leverages the subgradient extragradient method. We introduce an innovative step size rule that operates independently of the Lipschitz-type constants associated with the bifunction. Under mild assumptions, we establish the strong convergence of our algorithm to a common solution for the problems under consideration, which corresponds to a unique solution of a specific hierarchical variational inequality defined on their common solution set. Finally, we illustrate the advantages and efficiency of the proposed algorithm through a series of numerical examples.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A novel algorithm for approximating common solution of pseudomonotone equilibrium problem and common fixed point problem

  • Mohammad Eslamian,
  • Ahmad Kamandi

摘要

In this paper, we present a novel algorithm designed to approximate a common solution for both a pseudomonotone equilibrium problem and the common fixed point problem associated with a finite family of generalized demimetric mappings within a real Hilbert space. Our proposed algorithm employs an inertial approach that integrates a correction term and leverages the subgradient extragradient method. We introduce an innovative step size rule that operates independently of the Lipschitz-type constants associated with the bifunction. Under mild assumptions, we establish the strong convergence of our algorithm to a common solution for the problems under consideration, which corresponds to a unique solution of a specific hierarchical variational inequality defined on their common solution set. Finally, we illustrate the advantages and efficiency of the proposed algorithm through a series of numerical examples.