期刊
INVERSE PROBLEMS
卷 27, 期 12, 页码 -出版社
IOP PUBLISHING LTD
DOI: 10.1088/0266-5611/27/12/125007
关键词
-
资金
- VUB [GOA-062]
- FWO-Vlaanderen [G.0564.09N]
An explicit algorithm for the minimization of an l(1)-penalized least-squares functional, with non-separable l(1) term, is proposed. Each step in the iterative algorithm requires four matrix vector multiplications and a single simple projection on a convex set (or equivalently thresholding). Convergence is proven and a 1/N convergence rate is derived for the functional. In the special case where the matrix in the l(1) term is the identity (or orthogonal), the algorithm reduces to the traditional iterative soft-thresholding algorithm. In the special case where the matrix in the quadratic term is the identity (or orthogonal), the algorithm reduces to a gradient projection algorithm for the dual problem. By replacing the projection with a simple proximity operator, other convex non-separable penalties than those based on an l(1)-norm can be handled as well.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据