In this paper, a new accelerated fixed point algorithm for solving a common fixed point of a family of nonexpansive operators is introduced and studied, and then a weak convergence result and the convergence behavior of the proposed method is proven and discussed. Using our main result, we obtain a new accelerated image restoration algorithm, called the forward-backward modified W-algorithm (FBMWA), for solving a minimization problem in the form of the sum of two proper lower semi-continuous and convex functions. As applications, we apply the FBMWA algorithm to solving image restoration problems. We analyze and compare convergence behavior of our method with the others for deblurring the image. We found that our algorithm has a higher efficiency than the others in the literature.
27 February 2021 in Journal of Inequalities and Applications
In this paper, we consider and investigate a convex minimization problem of the sum of two convex functions in a Hilbert space. The forward-backward splitting algorithm is one of the popular optimization methods for approximating a minimizer of the function; however, the stepsize of this algorithm depends on the Lipschitz constant of the gradient of the function, which is not an easy work to find in general practice. By using a new modification of the linesearches of Cruz and Nghia [Optim. Methods Softw. 31:1209–1238, 2016] and Kankam et al. [Math. Methods Appl. Sci. 42:1352–1362, 2019] and an inertial technique, we introduce an accelerated viscosity-type algorithm without any Lipschitz continuity assumption on the gradient. A strong convergence result of the proposed algorithm is established under some control conditions. As applications, we apply our algorithm to solving image and signal recovery problems. Numerical experiments show that our method has a higher efficiency than the well-known methods in the literature.
The purpose of this paper is to invent an accelerated algorithm for the convex minimization problem which can be applied to the image restoration problem. T
In this paper, we introduce and study a new accelerated algorithm based on forward–backward and SP-algorithm for solving a convex minimization problem of the sum of two convex and lower semicontinuous functions in a Hilbert space. Under some suitable control conditions, a weak convergence theorem of the proposed algorithm based on a fixed point is established. Moreover, we choose the stepsize of our algorithm which is independent on the Lipschitz constant of the gradient of the objective function by using a linesearch technique, and then a weak convergence result of the proposed algorithm is analyzed. As applications, we apply the proposed algorithm for solving the image restoration problems and compare its convergence behavior with other well-known algorithms in the literature. By our experiment, the algorithms have a higher efficiency than the others.