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 develop a dynamical splitting method based on a nonlinear dynamical system with two proximal operators for solving the minimum value problem of the sum of three convex functions. The method endows some existing classical splitting methods such as the Forward-Backward splitting method and the Douglas-Rachford splitting method with continuous time behaviors. We demonstrate that the proposed dynamical system converges globally to a point whose image, imaged by each of the two proximal operators, is a solution to the minimum value problem. We also shows that both the residual of the two proximal operators and the objective error enjoy the convergence rates ofwhere  t  denotes time. This rate can be improved toby using an ergodic average technique. Moreover, under certain smoothness and metric subregularity conditions, we further establish the global exponential convergence of the dynamical splitting method. Finally, we apply the dynamical splitting method to deal with the problem of compressive sensing.

A Dynamical Splitting Method for Minimizing the Sum of Three Convex Functions