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/

Zendy Plus

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

Zendy Tools

Zendy Open

Douglas-Rachford method is a splitting algorithm for finding a zero of thesum of two maximal monotone operators. Each of its iterations requires thesequential solution of two proximal subproblems. The aim of this work is topresent a fully inexact version of Douglas-Rachford method wherein bothproximal subproblems are solved approximately within a relative errortolerance. We also present a semi-inexact variant in which the first subproblemis solved exactly and the second one inexactly. We prove that both methodsgenerate sequences weakly convergent to the solution of the underlyinginclusion problem, if any.

A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance