Proximal point method with Bregman distance for quasiconvex pseudomonotone equilibrium problems

In this paper, we propose a proximal point method by using Bregman distance to solve the quasiconvex pseudomonotone equilibrium problems. Under suitable assumptions, we prove that the proposed algorithm is well defined and the sequence generated by it converges to a solution of the equilibrium probl...

Full description

Saved in:
Bibliographic Details
Published inOptimization Vol. 74; no. 9; pp. 2035 - 2055
Main Authors Ansari, Qamrul Hasan, Babu, Feeroz, Raju, Muzaffar Sarkar
Format Journal Article
LanguageEnglish
Published Taylor & Francis 04.07.2025
Subjects
Bregman distance
Equilibrium problems
proximal point algorithm
pseudomonotonicity
strong quasiconvexity
Online AccessGet full text

Cover

More Information
Summary:In this paper, we propose a proximal point method by using Bregman distance to solve the quasiconvex pseudomonotone equilibrium problems. Under suitable assumptions, we prove that the proposed algorithm is well defined and the sequence generated by it converges to a solution of the equilibrium problem, whenever the bifunction is strongly quasiconvex in its second argument. Our method goes beyond the usual assumption of the bifunction's convexity in the second argument, extending the validity of the convergence analysis of proximal point methods for equilibrium problems. For a particular choice of the Bregman function, our method reduces to the traditional proximal point method. At the end, we illustrate our algorithm and convergence result by numerical examples.
ISSN:0233-1934
1029-4945
DOI:10.1080/02331934.2023.2252430