A Dynamical Splitting Method for Minimizing the Sum of Three Convex Functions. (25th January 2022)

• Record Type: Journal Article
• Authors: Zhu, Ming; Hu, Rong; Fang, Ya-Ping
• Is Part Of: Numerical functional analysis and optimization. Volume 43:Number 2(2022)
• Page Start: 221
• Page End: 246
• Publication Date: 2022-01-25
• Subjects: Dynamical system -- exponential convergence -- global convergence -- splitting method -- structural convex programming; 37N40 -- 47H05 -- 65K10 -- 90C25; Functional analysis -- Periodicals; Numerical analysis -- Periodicals; Mathematical optimization -- Periodicals; Numerical Analysis, Computer-Assisted; 515.705
• DOI: 10.1080/01630563.2021.2022692
• Languages: English
• ISSNs: 0163-0563

Abstract

Abstract: 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 of o ( 1 t ) where t denotes time. This rate can be improved to O ( 1 t ) by 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.