期刊
SIAM JOURNAL ON NUMERICAL ANALYSIS
卷 53, 期 1, 页码 421-444出版社
SIAM PUBLICATIONS
DOI: 10.1137/140965028
关键词
saddle-point problems; Douglas-Rachford splitting; linear preconditioners; convergence analysis
资金
- Austrian Science Fund (FWF) [SFB32]
- Austrian Science Fund (FWF) [F 3203] Funding Source: researchfish
We propose a preconditioned version of the Douglas-Rachford splitting method for solving convex-concave saddle-point problems associated with Fenchel-Rockafellar duality. Our approach makes it possible to use approximate solvers for the linear subproblem arising in this context. We prove weak convergence in Hilbert space under minimal assumptions. In particular, various efficient preconditioners are introduced in this framework for which only a few inner iterations are needed instead of computing an exact solution or controlling the error. The method is applied to a discrete total-variation denoising problem. Numerical experiments show that the proposed algorithms with appropriate preconditioners are very competitive with existing fast algorithms including the first-order primal-dual algorithm for saddle-point problems of Chambolle and Pock.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据