Journal
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume 158, Issue 2, Pages 460-479Publisher
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-012-0245-9
Keywords
Convex and nonsmooth optimization; Operator splitting; Primal-dual algorithm; Forward-backward method; Douglas-Rachford method; Monotone inclusion; Proximal method; Fenchel-Rockafellar duality
Ask authors/readers for more resources
We propose a new first-order splitting algorithm for solving jointly the primal and dual formulations of large-scale convex minimization problems involving the sum of a smooth function with Lipschitzian gradient, a nonsmooth proximable function, and linear composite functions. This is a full splitting approach, in the sense that the gradient and the linear operators involved are applied explicitly without any inversion, while the nonsmooth functions are processed individually via their proximity operators. This work brings together and notably extends several classical splitting schemes, like the forward-backward and Douglas-Rachford methods, as well as the recent primal-dual method of Chambolle and Pock designed for problems with linear composite terms.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available