English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we introduce a self-adaptive Bregman subgradient extragradient method for solving variational inequalities in the framework of a reflexive Banach space. The step-adaptive strategy avoids the difficult task of choosing a stepsize based on the Lipschitz constant of the cost function of the variational inequalities and improves the performance of the algorithm. Moreover, the use of the Bregman distance technique allows the consideration of a general feasible set for the problem. Under some suitable conditions, we prove some weak and strong convergence results for the sequence generated by the algorithm without prior knowledge of the Lipschitz constant. We further provide an application to contact problems and some numerical experiments to illustrate the performance of the algorithm.

A Bregman subgradient extragradient method with self-adaptive technique for solving variational inequalities in reflexive Banach spaces