A FIRST-ORDER SPLITTING METHOD FOR SOLVING A LARGE-SCALE COMPOSITE CONVEX OPTIMIZATION PROBLEM

• Published in: Journal of computational mathematics 2019-01, Vol.37 (5), p.666-688
• Main Authors: Tang, Yuchao, Wu, Guorong, Zhu, Chuanxi
• Format: Article
• Language: English
• ISSN: 0254-9409; 1991-7139
• DOI: 10.4208/jcm.1808-m2018-0027

In this paper, we construct several efficient first-order splitting algorithms for solving a multi-block composite convex optimization problem. The objective function includes a smooth function with a Lipschitz continuous gradient, a proximable convex function that may be nonsmooth, and a finite sum composed of a proximable function and a bounded linear operator. To solve such an optimization problem, we transform it into the sum of three convex functions by defining an appropriate inner product space. Based on the dual forward-backward splitting algorithm and the primal-dual forward-backward splitting algorithm, we develop several iterative algorithms that involve only computing the gradient of the differentiable function and proximity operators of related convex functions. These iterative algorithms are matrix-inversion-free and completely splitting algorithms. Finally, we employ the proposed iterative algorithms to solve a regularized general prior image constrained compressed sensing model that is derived from computed tomography image reconstruction. Numerical results show that the proposed iterative algorithms outperform the compared algorithms including the alternating direction method of multipliers, the splitting primal-dual proximity algorithm, and the preconditioned splitting primal-dual proximity algorithm.