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

In this paper, we propose a hybrid CQ projection algorithm with two projection steps and one Armijo-type line-search step for the split feasibility problem. The line-search technique is intended to construct a hyperplane that strictly separates the current point from the solution set. The next iteration is obtained by the projection of the initial point on a regress region (the intersection of three sets). Hence, algorithm converges faster than some other algorithms. Under some mild conditions, we show the convergence. Preliminary numerical experiments show that our algorithm is efficient

Hybrid CQ projection algorithm with line-search process for the split feasibility problem