<p>In this paper, using the Bregman distance technique, we introduce a proximal-type algorithm for solving equilibrium problems when the bifunction is pseudomonotone in real Hilbert spaces. The proposed algorithm involves only one strongly convex minimization subproblem, which makes our algorithm more effective than some existing algorithms in the literature. Under certain standard assumptions, we obtain a weak convergence result using the proposed algorithm. Finally, we present numerical experiments to illustrate the performance and applicability of our proposed algorithm.</p>

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

A Proximal-Type Algorithm with Bregman Distance for Solving Equilibrium Problems

  • Grace Nnennaya Ogwo,
  • Olawale Kazeem Oyewole,
  • Liya Liu

摘要

In this paper, using the Bregman distance technique, we introduce a proximal-type algorithm for solving equilibrium problems when the bifunction is pseudomonotone in real Hilbert spaces. The proposed algorithm involves only one strongly convex minimization subproblem, which makes our algorithm more effective than some existing algorithms in the literature. Under certain standard assumptions, we obtain a weak convergence result using the proposed algorithm. Finally, we present numerical experiments to illustrate the performance and applicability of our proposed algorithm.