On the convergence of a linesearch based proximal-gradient method for nonconvex optimization

Inverse Problems, pp. 0550052017.

Cited by: 8|Views7

Abstract:

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

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments