arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1807.04005math.OC
收藏

更快的FISTA

Faster FISTA

Jingwei Liang, Carola-Bibiane Schönlieb

摘要:

“快速迭代收缩阈值算法”,又名。FISTA是文献中使用最广泛的算法之一。然而,尽管其最佳理论$O(1/k^2)$收敛速度保证,但由于(局部)振荡行为,其性能在实践中常常不如所期望的。多年来,各种方法被提出来克服这个缺点的FISTA,在本文中,我们提出了一个简单而有效的修改算法,它有两个优点:1)它使我们能够证明所产生的序列的收敛性; 2)它显示出优越的实际性能相比,原来的FISTA。数值实验表明了该算法的优越性能。

英文摘要:

The ``fast iterative shrinkage-thresholding algorithm'', a.k.a. FISTA, is one of the most widely used algorithms in the literature. However, despite its optimal theoretical $O(1/k^2)$ convergence rate guarantee, oftentimes in practice its performance is not as desired owing to the (local) oscillatory behaviour. Over the years, various approaches are proposed to overcome this drawback of FISTA, in this paper, we propose a simple yet effective modification to the algorithm which has two advantages: 1) it enables us to prove the convergence of the generated sequence; 2) it shows superior practical performance compared to the original FISTA. Numerical experiments are presented to illustrate the superior performance of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑