Modified Bregman extragradient algorithm for equilibrium problems in Banach spaces

This paper introduces a modified Bregman extragradient algorithm designed to solve pseudomonotone equilibrium problems in a real reflexive Banach space. The algorithm guarantees weak convergence under mild assumptions and establishes strong convergence under additional conditions. In our proposed algorithm, we utilize two parameters with the Bregman distance and a non-monotonic step size, which is independent of the Bregman Lipschitz constant, to enhance the algorithm's effectiveness. Furthermore, numerical experiments are conducted to validate the performance of the proposed algorithm, demonstrating significant improvements in efficiency compared to traditional algorithms in similar settings.

Authors

Institutions

Publication Details

Journal
Statistics Optimization & Information Computing
Published
2025-10-25
DOI
https://doi.org/10.19139/soic-2310-5070-2642
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Modified Bregman extragradient algorithm for equilibrium problems in Banach spaces

Bochra ZEGHAD
Statistics Optimization & Information Computing
Optimization and Variational Analysis
article

Modified Bregman extragradient algorithm for equilibrium problems in Banach spaces

Bochra ZEGHAD
article en

Abstract

This paper introduces a modified Bregman extragradient algorithm designed to solve pseudomonotone equilibrium problems in a real reflexive Banach space. The algorithm guarantees weak convergence under mild assumptions and establishes strong convergence under additional conditions. In our proposed algorithm, we utilize two parameters with the Bregman distance and a non-monotonic step size, which is independent of the Bregman Lipschitz constant, to enhance the algorithm's effectiveness. Furthermore, numerical experiments are conducted to validate the performance of the proposed algorithm, demonstrating significant improvements in efficiency compared to traditional algorithms in similar settings.

Statistics Optimization & Information ComputingVol. 14(5)
University Ferhat Abbas of Setif (DZ)
Openalex Percentile: Top 67%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.