A variant of the proximal gradient method for constrained convex minimization problems

. This paper presents a new variant of the proximal gradient algorithm based on double inertial extrapolation to solve a constrained convex minimization problem in real Hilbert spaces. We discuss its weak convergence, including numerical image and signal recovery experiments to support the main results. Some comparisons with other algorithms are also provided. The experiments demonstrate that our method converges better than the other methods in the literature