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

Real life problems are entrenched in ambiguities. To deal with these ambiguities, stochastic functional analysis has emerged as one of the mathematical tools for solving these kinds of problems. The purpose of this paper is to extend the convergence results of deterministic convex feasibility problems to a stochastic convex feasibility problem and prove that the solution of a convex feasibility problem generated by random Mann-type and Simultaneous projection iterative algorithms with firmly non-expansive mapping converge in quadratic mean and consequently in probability to random fixed point in Hilbert space. These results extend, unify, and generalize different established deterministic results in the literature.

Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space