Full Text: PDF
Received October 3, 2021; Accepted November 12, 2021; Published December 28, 2021.
Abstract. This paper investigates a relaxed inertial three-operator splitting algorithm for solving the convex optimal problems of the sum of three functions in a real Hilbert space. The corresponding summable perturbation algorithm is also studied. The algorithm is then applied to the general minimization problem of the sum of finite convex functions. Strong convergence of the algorithms are obtained. These algorithms improve the existing results, and the feasibility of them are illustrated by two numerical examples.
How to Cite this Article:
Yanni Guo, Weixia Wang, Strong convergence of a relaxed inertial three-operator splitting algorithm for the minimization problem of the sum of three or more functions, Journal of Nonlinear Functional Analysis, Vol. 2021 (2021), Article ID 41, pp. 1-19.