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

求解凸凹鞍点问题的加速Douglas-Rachford方法

Accelerated Douglas-Rachford methods for the solution of convex-concave saddle-point problems

Kristian Bredies, Hongpeng Sun

摘要:

研究了一类求解与Fenchel-Rockafellar对偶相关的凸凹鞍点问题的Douglas-Rachford方法的加速策略和预处理策略.虽然基本迭代在希尔伯特空间中弱收敛,但限制原始-对偶间隙的$\mathcal{O}(1/k)$遍历收敛,在强凸性假设下可以实现加速。也就是说,如果在鞍点公式中的原始或对偶泛函是强凸的,则可以修改该方法以产生$\mathcal{O}(1/k^2)$遍历收敛。在两个泛函都是强凸的情况下,类似的修正导致了对于某些$0 < {\vartheta} < 1$,$\mathcal{O}({\vartheta}^k)$的渐近收敛性.所有方法特别允许预处理,即,在保持所有收敛速度的情况下,用线性分裂方法得到了隐式线性步长的不精确解。所提出的方法的效率进行了验证和数值比较,特别是显示相对于国家的最先进的加速算法的竞争力。

英文摘要:

We study acceleration and preconditioning strategies for a class of Douglas-Rachford methods aiming at the solution of convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. While the basic iteration converges weakly in Hilbert space with $\mathcal{O}(1/k)$ ergodic convergence of restricted primal-dual gaps, acceleration can be achieved under strong-convexity assumptions. Namely, if either the primal or dual functional in the saddle-point formulation is strongly convex, then the method can be modified to yield $\mathcal{O}(1/k^2)$ ergodic convergence. In case of both functionals being strongly convex, similar modifications lead to an asymptotic convergence of $\mathcal{O}({\vartheta}^k)$ for some $0 < {\vartheta} < 1$. All methods allow in particular for preconditioning, i.e., the inexact solution of the implicit linear step in terms of linear splitting methods with all convergence rates being maintained. The efficiency of the proposed methods is verified and compared numerically, especially showing competitiveness with respect to state-of-the-art accelerated algorithms.

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

↑