Skip to Main content Skip to Navigation
Journal articles

A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms

Laurent Condat 1, 2, *
* Corresponding author
1 Equipe Image - Laboratoire GREYC - UMR6072
GREYC - Groupe de Recherche en Informatique, Image, Automatique et Instrumentation de Caen
Abstract : 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.
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00609728
Contributor : Laurent Condat <>
Submitted on : Sunday, August 4, 2013 - 8:46:49 AM
Last modification on : Wednesday, October 7, 2020 - 11:40:06 AM
Long-term archiving on: : Wednesday, April 5, 2017 - 7:18:17 PM

File

Condat-optim-JOTA-2013.pdf
Files produced by the author(s)

Identifiers

Citation

Laurent Condat. A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. Journal of Optimization Theory and Applications, Springer Verlag, 2013, 158 (2), pp.460-479. ⟨10.1007/s10957-012-0245-9⟩. ⟨hal-00609728v5⟩

Share

Metrics

Record views

1648

Files downloads

1643