期刊
INVERSE PROBLEMS
卷 33, 期 5, 页码 -出版社
IOP PUBLISHING LTD
DOI: 10.1088/1361-6420/aa5bfd
关键词
proximal gradient methods; variable metric; line search methods; image processing applications
资金
- MIUR [RBFR12M3AC, 2012MTE38N]
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-Lojasiewicz property at each point of its domain, under the assumption that a limit point exists. The proposed method is applied to a wide collection of image processing problems and our numerical tests show that our algorithm results to be flexible, robust and competitive when compared to recently proposed approaches able to address the optimization problems arising in the considered applications.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据