Skip to Main content Skip to Navigation
Journal articles

A Generic Proximal Algorithm for Convex Optimization—Application to Total Variation Minimization

Abstract : We propose new optimization algorithms to minimize a sum of convex functions, which may be smooth or not and composed or not with linear operators. This generic formulation encompasses various forms of regularized inverse problems in imaging. The proposed algorithms proceed by splitting: the gradient or proximal operators of the functions are called individually, without inner loop or linear system to solve at each iteration. The algorithms are easy to implement and have proven convergence to an exact solution. The classical Douglas-Rachford and forward-backward splitting methods, as well as the recent and efficient algorithm of Chambolle-Pock, are recovered as particular cases. The application to inverse imaging problems regularized by the total variation is detailed.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01120544
Contributor : Laurent Condat <>
Submitted on : Thursday, February 26, 2015 - 12:08:22 AM
Last modification on : Thursday, November 19, 2020 - 1:01:04 PM

Identifiers

Collections

Citation

Laurent Condat. A Generic Proximal Algorithm for Convex Optimization—Application to Total Variation Minimization. IEEE Signal Processing Letters, Institute of Electrical and Electronics Engineers, 2014, 21 (8), pp. 1054-1057. ⟨10.1109/LSP.2014.2322123⟩. ⟨hal-01120544⟩

Share

Metrics

Record views

282