A first-order primal-dual algorithm for convex problems with applications to imaging

Abstract : We study a first-order primal-dual algorithm for convex optimization problems with known saddle-point structure. We prove convergence to a saddle-point with rate O(1/N) in finite dimensions, which is optimal for the complete class of non-smooth problems we are considering in this paper. We further show accelerations of the proposed algorithm to yield optimal rates on easier problems. In particular we show that we can achieve O(1/N²) convergence on problems, where the primal or the dual objective is uniformly convex, and we can show linear convergence, i.e. O(1/e^N) on problems where both are uniformly convex. The wide applicability of the proposed algorithm is demonstrated on several imaging problems such as image denoising, image deconvolution, image inpainting, motion estimation and image segmentation.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00490826
Contributor : Antonin Chambolle <>
Submitted on : Wednesday, June 9, 2010 - 5:37:53 PM
Last modification on : Wednesday, March 27, 2019 - 4:08:31 PM
Long-term archiving on : Friday, September 17, 2010 - 1:01:29 PM

File

pd_alg_final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00490826, version 1

Collections

Citation

Antonin Chambolle, Thomas Pock. A first-order primal-dual algorithm for convex problems with applications to imaging. 2010. ⟨hal-00490826⟩

Share

Metrics

Record views

3215

Files downloads

27647