期刊
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
卷 173, 期 3, 页码 878-907出版社
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-017-1112-5
关键词
Alternating direction method of multipliers; Proximal point algorithm; Weak convergence analysis; Linear preconditioning techniques
资金
- Austrian Science Fund (FWF) [SFB32]
- Fundamental Research Funds for the Central Universities
- Renmin University of China [15XNLF20]
We study preconditioned algorithms of alternating direction method of multipliers type for nonsmooth optimization problems. The alternating direction method of multipliers is a popular first-order method for general constrained optimization problems. However, one of its drawbacks is the need to solve implicit subproblems. In various applications, these subproblems are either easily solvable or linear, but nevertheless challenging. We derive a preconditioned version that allows for flexible and efficient preconditioning for these linear subproblems. The original and preconditioned version is written as a new kind of proximal point method for the primal problem, and the weak (strong) convergence in infinite (finite) dimensional Hilbert spaces is proved. Various efficient preconditioners with any number of inner iterations may be used in this preconditioned framework. Furthermore, connections between the preconditioned version and the recently introduced preconditioned Douglas-Rachford method for general nonsmooth problems involving quadratic-linear terms are established. The methods are applied to total variation denoising problems, and their benefits are shown in numerical experiments.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据