An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex   optimization problems
  We investigate the convergence of a forward-backward-forward proximal-type algorithm with inertial and memory effects when minimizing the sum of a nonsmooth function with a smooth one in the absence of convexity. The convergence is obtained provided an appropriate regularization of the objective satisfies the Kurdyka-\L{}ojasiewicz inequality, which is for instance fulfilled for semi-algebraic functions. 
Radu Ioan Bot, Ern\"o Robert Csetnek
math.OC math.NA