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, based on the viscosity approximation method and the regularized gradient-projection algorithm, we find a common element of the solution set of a constrained convex minimization problem and the set of zero points of the maximal monotone operator problem. In particular, the set of zero points of the maximal monotone operator problem can be transformed into the equilibrium problem. Under suitable conditions, new strong convergence theorems are obtained, which are useful in nonlinear analysis and optimization. As an application, we apply our algorithm to solving the split feasibility problem and the constrained convex minimization problem in Hilbert spaces.

Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator