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

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.

[1]  D. Cremers.  Convex Relaxation Techniques for Segmentation , Stereo and Multiview Reconstruction , 2010 .

[2]  Julien Mairal,et al.  Optimization with Sparsity-Inducing Penalties , 2011, Found. Trends Mach. Learn..

[3]  A. Chambolle,et al.  An introduction to Total Variation for Image Analysis , 2009 .

[4]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[5]  Antonin Chambolle,et al.  Diagonal preconditioning for first order primal-dual algorithms in convex optimization , 2011, 2011 International Conference on Computer Vision.

[6]  T. Chan,et al.  Fast dual minimization of the vectorial total variation norm and applications to color image processing , 2008 .

[7]  Patrick L. Combettes,et al.  A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality , 2010, SIAM J. Optim..

[8]  Ferréol Soulez,et al.  Joint deconvolution and demosaicing , 2009, 2009 16th IEEE International Conference on Image Processing (ICIP).

[9]  Patrick L. Combettes,et al.  Proximal Splitting Methods in Signal Processing , 2009, Fixed-Point Algorithms for Inverse Problems in Science and Engineering.

[10]  Valérie R. Wajs,et al.  A variational formulation for frame-based inverse problems , 2007 .

[11]  Christoph Schnörr,et al.  Fast and Exact Primal-Dual Iterations for Variational Problems in Computer Vision , 2010, ECCV.

[12]  Emmanuel J. Candès,et al.  Templates for convex cone problems with applications to sparse signal recovery , 2010, Math. Program. Comput..

[13]  Laurent Condat,et al.  A Primal–Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms , 2012, Journal of Optimization Theory and Applications.

[14]  I. Loris,et al.  On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty , 2011, 1104.1087.

[15]  E. Sidky,et al.  Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle–Pock algorithm , 2011, Physics in medicine and biology.

[16]  L. Briceño-Arias.  Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions , 2012, 1212.5942.

[17]  Laurent Condat,et al.  Joint demosaicking and denoising by total variation minimization , 2012, 2012 19th IEEE International Conference on Image Processing.

[18]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[19]  F. Soulez,et al.  Restoration of Hyperspectral Astronomical Data with Spectrally Varying Blur , 2020, New Concepts in Imaging: Optical and Statistical Models.

[20]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[21]  Michael B. Wakin.  Sparse Image and Signal Processing: Wavelets, Curvelets, Morphological Diversity (Starck, J.-L., et al; 2010) [Book Reviews] , 2011, IEEE Signal Processing Magazine.

[22]  J. Aujol,et al.  Some proximal methods for Poisson intensity CBCT and PET , 2012 .

[23]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[24]  Bang Công Vu,et al.  A splitting algorithm for dual monotone inclusions involving cocoercive operators , 2011, Advances in Computational Mathematics.

[25]  Ernie Esser,et al.  Applications of Lagrangian-Based Alternating Direction Methods and Connections to Split Bregman , 2009 .

[26]  Xiaoqun Zhang,et al.  A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration , 2013 .

[27]  P. L. Combettes,et al.  Variable metric forward–backward splitting with applications to monotone inclusions in duality , 2012, 1206.6791.

[28]  P. L. Combettes,et al.  Primal-Dual Splitting Algorithm for Solving Inclusions with Mixtures of Composite, Lipschitzian, and Parallel-Sum Type Monotone Operators , 2011, Set-Valued and Variational Analysis.

[29]  J. Pesquet,et al.  A Parallel Inertial Proximal Optimization Method , 2012 .

[30]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

[31]  Simon Setzer,et al.  Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing , 2011, International Journal of Computer Vision.

[32]  Mohamed-Jalal Fadili,et al.  A Generalized Forward-Backward Splitting , 2011, SIAM J. Imaging Sci..

[33]  Victor Vianu,et al.  Invited articles section foreword , 2010, JACM.

[34]  Luca Baldassarre,et al.  Optimal Computational Trade-Off of Inexact Proximal Methods , 2012, ArXiv.

[35]  Hugues Talbot,et al.  A Convex Approach for Image Restoration with Exact Poisson-Gaussian Likelihood , 2015, SIAM J. Imaging Sci..