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 Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

In this paper, we study strong convergence of some proximal-type algorithms to a solution of split minimization problem in complete p-uniformly convex metric spaces. We also analyse asymptotic behaviour of the sequence generated by Halpern-type proximal point algorithm and extend it to approximate a common solution of a finite family of minimization problems in the setting of complete p-uniformly convex metric spaces. Furthermore, numerical experiments of our algorithms in comparison with other algorithms are given to show the applicability of our results.

Proximal-type algorithms for split minimization problem in P-uniformly convex metric spaces