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

Journal of Mathematical Imaging and Vision

Volumn 40, Issue 1, 2011, Pages 120-145

  Chambolle, Antonin ^a   Pock, Thomas ^b  

^a CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

^b GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Convex optimization; Dual approaches; Image; Inverse problems; Reconstruction; Total variation

Indexed keywords

CONVEX OPTIMIZATION PROBLEMS; CONVEX PROBLEMS; DUAL APPROACHES; FINITE DIMENSIONS; FIRST-ORDER; IMAGE; IMAGE DE-NOISING; IMAGE DECONVOLUTION; IMAGE INPAINTING; IMAGING PROBLEMS; LINEAR CONVERGENCE; NON-SMOOTH; PRIMAL DUAL ALGORITHMS; RECONSTRUCTION; SADDLE POINT; TOTAL VARIATION; UNIFORMLY CONVEXES;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; CONVEX OPTIMIZATION; DECONVOLUTION; DIFFERENTIAL EQUATIONS; IMAGE SEGMENTATION; MOTION ESTIMATION; OPTIMIZATION;

INVERSE PROBLEMS;

EID: 79953201848     PISSN: 09249907     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10851-010-0251-1     Document Type: Article

References (37)

1. Arrow, K.J.; Hurwicz, L.; Uzawa, H.: Studies in linear and non-linear programming. In: Chenery, H.B.; Johnson, S.M.; Karlin, S.; Marschak, T.; Solow, R.M. (eds.) Stanford Mathematical Studies in the Social Sciences, vol. II. Stanford University Press, Stanford (1958)
2. A. Beck M. Teboulle 2009 A fast iterative shrinkage-thresholding algorithm for linear inverse problems SIAM J. Imaging Sci. 2 1 183 202 2486527 1175.94009 10.1137/080716542
3. Boyle, J.P.; Dykstra, R.L.: A method for finding projections onto the intersection of convex sets in Hilbert spaces. In: Advances in Order Restricted Statistical Inference, Iowa City, Iowa, 1985. Lecture Notes in Statist.; vol. 37, pp. 28-47. Springer, Berlin (1986)
4. K.A. Brakke 1995 Soap films and covering spaces J. Geom. Anal. 5 4 445 514 1393090 0848.49025
5. E. Candès L. Demanet D. Donoho L. Ying 2006 Fast discrete curvelet transforms Multiscale Model. Simul. 5 3 861 899 2257238 1122.65134 10.1137/05064182X electronic (Pubitemid 47381814)
6. A. Chambolle 2004 An algorithm for total variation minimization and applications J. Math. Imaging Vis. 20 1-2 89 97 2049783 Special issue on mathematics and image analysis
7. Chambolle, A.: Total variation minimization and a class of binary MRF models. In: Energy Minimization Methods in Computer Vision and Pattern Recognition, pp. 136-152 (2005) (Pubitemid 43722931)
8. Chambolle, A.; Cremers, D.; Pock, T.: A convex approach for computing minimal partitions. Technical Report 649, CMAP, Ecole Polytechnique, France (2008)
9. Chambolle, A.; Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. http://hal.archives-ouvertes.fr/hal- 00490826 (2010)
10. J. Eckstein D.P. Bertsekas 1992 On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Math. Program.; Ser. A 55 3 293 318 1168183 0765.90073 10.1007/BF01581204
11. Esser, E.: Applications of Lagrangian-based alternating direction methods and connections to split Bregman. CAM Reports 09-31, UCLA, Center for Applied Math. (2009)
12. Esser, E.; Zhang, X.; Chan, T.: A general framework for a class of first order primal-dual algorithms for tv minimization. CAM Reports 09-67, UCLA, Center for Applied Math. (2009)
13. Fadili, J.; Peyré, G.: Total variation projection with first order schemes. http://hal.archives-ouvertes.fr/hal-00380491/ (2009)
14. J. Fadili J.-L. Starck M. Elad D. Donoho 2010 Mcalab: Reproducible research in signal and image decomposition and inpainting Comput. Sci. Eng. 12 1 44 63 10.1109/MCSE.2010.14
15. Goldstein, T.; Osher, S.: The split Bregman algorithm for l1 regularized problems. CAM Reports 08-29, UCLA, Center for Applied Math. (2008)
16. He, B.; Yuan, X.: Convergence analysis of primal-dual algorithms for total variation image restoration. Technical Report 2790, Optimization Online, November 2010 (available at www.optimization-online.org )
17. G.M. Korpelevič 1976 An extragradient method for finding saddle points and for other problems Èkon. Mat. Metody 12 4 747 756 0342.90044
18. G. Lawlor F. Morgan 1994 Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms Pac. J. Math. 166 1 55 83 1306034 0830.49028
19. P.-L. Lions B. Mercier 1979 Splitting algorithms for the sum of two nonlinear operators SIAM J. Numer. Anal. 16 6 964 979 551319 0426.65050 10.1137/0716071
20. n J. Optim. Theory Appl. 50 1 195 200 851135 0571.90074 10.1007/BF00938486 (Pubitemid 16612112)
21. D. Mumford J. Shah 1989 Optimal approximation by piecewise smooth functions and associated variational problems Commun. Pure Appl. Math. 42 577 685 997568 0691.49036 10.1002/cpa.3160420503
22. A. Nedić A. Ozdaglar 2009 Subgradient methods for saddle-point problems J. Optim. Theory Appl. 142 1 1 2520357 10.1007/s10957-009-9539-y
23. A. Nemirovski 2004 Prox-method with rate of convergence O(1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems SIAM J. Optim. 15 1 229 251 2112984 1106.90059 10.1137/S1052623403425629 electronic (Pubitemid 40360669)
24. Nemirovski, A.; Yudin, D.: Problem Complexity and Method Efficiency in Optimization. A Wiley-Interscience Publication. Wiley, New York (1983). Translated from the Russian and with a preface by E.R. Dawson, Wiley-Interscience Series in Discrete Mathematics
25. 2) Dokl. Akad. Nauk SSSR 269 3 543 547 701288
26. Nesterov, Yu.: Introductory Lectures on Convex Optimization. Applied Optimization, vol. 87. Kluwer Academic, Boston (2004). A basic course
27. Yu. Nesterov 2005 Smooth minimization of non-smooth functions Math. Program.; Ser. A 103 1 127 152 2166537 1079.90102 10.1007/s10107-004-0552-5 (Pubitemid 40537674)
28. Nesterov, Yu.: Gradient methods for minimizing composite objective function. Technical report, CORE DISCUSSION PAPER (2007)
29. Pock, T.; Cremers, D.; Bischof, H.; Chambolle, A.: An algorithm for minimizing the Mumford-Shah functional. In: ICCV Proceedings, LNCS. Springer, Berlin (2009)
30. L.D. Popov 1980 A modification of the Arrow-Hurwitz method of search for saddle points Mat. Zametki 28 5 777 784 599872 0456.90068
31. R.T. Rockafellar 1976 Monotone operators and the proximal point algorithm SIAM J. Control Optim. 14 5 877 898 410483 0358.90053 10.1137/0314056
32. Rockafellar, R.T.: Convex Analysis, Princeton Landmarks in Mathematics. Princeton University Press, Princeton (1997). Reprint of the 1970 original, Princeton Paperbacks
33. L. Rudin S.J. Osher E. Fatemi 1992 Nonlinear total variation based noise removal algorithms Physica D 60 259 268 0780.49028 10.1016/0167-2789(92)90242-F also in Experimental Mathematics: Computational Issues in Nonlinear Science (Proc. Los Alamos Conf. 1991)
34. Shulman, D.; Hervé, J.-Y.: Regularization of discontinuous flow fields. In: Proceedings Workshop on Visual Motion, pp. 81-86 (1989)
35. Zach, C.; Gallup, D.; Frahm, J.M.; Niethammer, M.: Fast global labeling for real-time stereo using multiple plane sweeps. In: Vision, Modeling, and Visualization 2008, pp. 243-252. IOS Press, Amsterdam (2008)
36. 1 optical flow. In: 29th DAGM Symposium on Pattern Recognition, pp. 214-223. Heidelberg, Germany (2007)
37. Zhu, M.; Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. CAM Reports 08-34, UCLA, Center for Applied Math. (2008)