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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

The paper deals with a numerical method for solving a monotone variational inequality problem in a Hilbert space. The algorithm is inspired by Popov's modified extragradient method and the Bregman projection with a simple stepsize rule. Applying Bregman projection allows the algorithm to be more flexible in computations when choosing a projection. The stepsizes, which vary from step to step, are found over each iteration by a cheap computation without any linesearch. The convergence of the algorithm is proved without the prior knowledge of Lipschitz constant of the operator involved. Some numerical experiments are performed to illustrate the computational performances of the new algorithm with several known Bregman distances. The obtained results in this paper extend some existing results in the literature.

Modified extragradient method with Bregman distance for variational inequalities