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

We develop two "Nesterov's accelerated" variants of the well-knownextragradient method to approximate a solution of a co-hypomonotone inclusionconstituted by the sum of two operators, where one is Lipschitz continuous andthe other is possibly multivalued. The first scheme can be viewed as anaccelerated variant of Tseng's forward-backward-forward splitting (FBFS)method, while the second one is a Nesterov's accelerated variant of the "past"FBFS scheme, which requires only one evaluation of the Lipschitz operator andone resolvent of the multivalued mapping. Under appropriate conditions on theparameters, we theoretically prove that both algorithms achieve$\mathcal{O}(1/k)$ last-iterate convergence rates on the residual norm, where$k$ is the iteration counter. Our results can be viewed as alternatives of arecent class of Halpern-type methods for root-finding problems. For comparison,we also provide a new convergence analysis of the two recent extra-anchoredgradient-type methods for solving co-hypomonotone inclusions.

Extragradient-Type Methods with $\mathcal{O} (1/k)$ Last-Iterate Convergence Rates for Co-Hypomonotone Inclusions