New inertial forward–backward algorithm for convex minimization with applications

Abstract

In this work, we present a new proximal gradient algorithm based on Tseng’s extragradient method and an inertial technique to solve the convex minimization problem in real Hilbert spaces. Using the stepsize rules, the selection of the Lipschitz constant of the gradient of functions is avoided. We then prove the weak convergence theorem and present the numerical experiments for image recovery. The comparative results show that the proposed algorithm has better efficiency than other methods.

Keywords

• tseng’s extragradient method
• image recovery
• inertial technique
• minimization problem
• 65k05
• 90c25
• 90c30