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

Let X  be a real reflexive Banach space,  let C  be a closed convex subset of X, and let A be an m-accretive operator with a zero. Consider the iterative method that generates the sequence {xn} by the algorithm xn+1=ÃŽÂ±nf(xn)+(1Ã¢ÂˆÂ’ÃŽÂ±n)Jrnxn, where ÃŽÂ±n and ÃŽÂ³n are two sequences satisfying certain conditions, Jr denotes the resolvent (I+rA)Ã¢ÂˆÂ’1 for r>0, and let  f:CÃ¢Â†Â’C be a fixed contractive mapping. The strong convergence of the algorithm {xn} is proved assuming that X  has a weakly continuous duality map

Viscosity approximation fixed points for nonexpansive and "Equation missing" -accretive operators