On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
Inverse Problems, pp. 0550052017.
We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a critical point if the objective function satisfies the Kurdyka–Łojasiewicz property at each point of ...More
Full Text (Upload PDF)
PPT (Upload PPT)