New inertial proximal gradient methods for unconstrained convex optimization problems

The proximal gradient method is a highly powerful tool for solving the composite convex optimization problem. In this paper, firstly, we propose inexact inertial acceleration methods based on the viscosity approximation and proximal scaled gradient algorithm to accelerate the convergence of the algo...

Ausführliche Beschreibung