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

前向Douglas-Rachford分裂格式的收敛速度分析

Convergence rate analysis of the forward-Douglas-Rachford splitting scheme

Damek Davis

摘要:

算子分裂格式是一类求解复杂单调包含和凸优化问题的强有力的算法。它们产生了一种算法,在这种算法中,分解的所有简单片段都被单独处理。这导致易于实现和高度并行化或分布式算法,通常获得接近最先进的性能。本文分析了前向-道格拉斯-拉奇福德分裂(FDRS)算法的收敛速度,FDRS算法是前向-后向分裂(FBS)和道格拉斯-拉奇福德分裂(DRS)算法的推广.在一般的凸性假设下,我们推导了FDRS算法的遍历和非遍历收敛速度,并证明了这些速度是最好的。在Lipschitz可微性假设下,我们证明了FDRS算法的最佳收敛速度与FBS算法的最后一个收敛速度一样快。在强凸性假设下,我们得到了序列强收敛到极小点的收敛速度。在强凸性和Lipschitz可微性假设下,证明了FDRS线性收敛.我们还提供了例子,目标是强凸的,但FDRS收敛任意缓慢。最后,我们将FDRS算法与原始-对偶前向-后向分裂方案联系起来,并阐明其在现有分裂方法中的地位。我们的研究结果表明,FDRS算法自动适应的规则性的目标函数,并实现利率,提高了尖锐的最坏情况下举行的光滑性和强凸性。

英文摘要:

Operator splitting schemes are a class of powerful algorithms that solve complicated monotone inclusion and convex optimization problems that are built from many simpler pieces. They give rise to algorithms in which all simple pieces of the decomposition are processed individually. This leads to easily implementable and highly parallelizable or distributed algorithms, which often obtain nearly state-of-the-art performance. In this paper, we analyze the convergence rate of the forward-Douglas-Rachford splitting (FDRS) algorithm, which is a generalization of the forward-backward splitting (FBS) and Douglas-Rachford splitting (DRS) algorithms. Under general convexity assumptions, we derive the ergodic and nonergodic convergence rates of the FDRS algorithm, and show that these rates are the best possible. Under Lipschitz differentiability assumptions, we show that the best iterate of FDRS converges as quickly as the last iterate of the FBS algorithm. Under strong convexity assumptions, we derive convergence rates for a sequence that strongly converges to a minimizer. Under strong convexity and Lipschitz differentiability assumptions, we show that FDRS converges linearly. We also provide examples where the objective is strongly convex, yet FDRS converges arbitrarily slowly. Finally, we relate the FDRS algorithm to a primal-dual forward-backward splitting scheme and clarify its place among existing splitting methods. Our results show that the FDRS algorithm automatically adapts to the regularity of the objective functions and achieves rates that improve upon the sharp worst case rates that hold in the absence of smoothness and strong convexity.

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

↑