A unified primal-dual algorithm framework based on Bregman iteration

Journal of Scientific Computing

Volumn 46, Issue 1, 2011, Pages 20-46

  Zhang, Xiaoqun ^c   Burger, Martin ^a   Osher, Stanley ^b  

^a UNIVERSITY OF MÜNSTER   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c NONE

Author keywords

1 minimization; Bregman iteration; Inexact Uzawa methods; Proximal point iteration; Saddle point

Indexed keywords

ALGORITHM FRAMEWORK; BASIS PURSUITS; BREGMAN ITERATION; EXISTING METHOD; INEXACT UZAWA METHODS; MATRIX COMPLETION; MULTISCALE MODELS; NUMERICAL EXAMPLE; PRIMAL DUAL ALGORITHMS; PROXIMAL POINTS; RICE UNIVERSITY; SADDLE POINT; SIGNAL AND IMAGE PROCESSING;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; IMAGE PROCESSING; OPTIMIZATION;

ITERATIVE METHODS;

EID: 78651419159     PISSN: 08857474     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10915-010-9408-8     Document Type: Article

References (53)

1. Arrow, K.J.; Hurwicz, L.; Uzawa, H.: Studies in Linear and Non-Linear Programming. Stanford University Press, Stanford (1958)
2. Avinash, C.; Malcolm, S.: Principles of Computerized Tomographic Imaging. Society for Industrial and Applied Mathematics, Philadelphia (2001)
3. Beck, A.; Teboulle, M.: A fast iterative shrinkage-thresholding algorithm with application to wavelet-based image deblurring. In: IEEE International Conference on Acoustics, Speech, and Signal Processing, pp. 693-696 (2009)
4. Becker, S.; Bobin, J.; Candès, E.: Nesta: a fast and accurate first-order method for sparse recovery (2009)
5. Borghi, A.; Darbon, J.; Peyronnet, S.; Chan, T.F.; Osher, S.: A simple compressive sensing algorithm for parallel many-core architectures. CAM Report 08-64, UCLA (2008)
6. J.H. Bramble J.E. Pasciak A.T. Vassilev 1997 Analysis of the inexact Uzawa algorithm for saddle point problems SIAM J. Numer. Anal. 34 3 1072 1092 0873.65031 10.1137/S0036142994273343 1451114
7. L. Bregman 1967 The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming USSR Comput. Math. Math Phys. 7 200 217 10.1016/0041-5553(67)90040-7
8. J.-F. Cai E.J. Candès Z. Shen 2010 A singular value thresholding algorithm for matrix completion SIAM J. Optim. 20 4 1956 1982 1201.90155 10.1137/080738970 2600248
9. 1-norm minimization Math. Comput. 78 2127 2136 1198.65103 10.1090/S0025-5718-09-02242-X 2521281
10. Cai, J.-F.; Osher, S.; Shen, Z.: Split Bregman method and frame based image restoration. CAM Report 09-28, UCLA, March 2009
11. J.-F. Cai S. Osher Z. Shen 2009 Linearized Bregman iterations for frame-based image deblurring SIAM J. Imag. Sci. 2 1 226 252 1175.94010 10.1137/080733371 2486529
12. Candès, E.J.; Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. (2008, to appear)
13. E.J. Candès J. Romberg T. Tao 2006 Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inf. Theory 52 2 489 509 10.1109/TIT.2005.862083 (Pubitemid 43174093)
14. Y. Censor A. Lent 1981 An iterative row-action method for interval convex programming J. Optim. Theory Appl. 34 3 321 353 0431.49042 10.1007/BF00934676 628201
15. A. Chambolle 2004 An algorithm for total variation minimization and applications J. Math. Imag. Vis. 20 89 97 10.1023/B:JMIV.0000011321.19549.88 2049783
16. T.F. Chan G.H. Golub P. Mulet 1996 A nonlinear primal-dual method for total variation-based image restoration Math. Oper. Res. 219 241 252 1430131
17. Chen, G.; Teboulle, M.: Convergence analysis of a proximal like minimization algorithm using Bregman functions. SIAM J. Optim.; 3 (1993)
18. G. Chen M. Teboulle 1994 A proximal-based decomposition method for convex minimization problems Math. Program. 64 1 81 101 0823.90097 10.1007/BF01582566 1274173
19. S.S. Chen David L. Donoho M.A. Saunders 1998 Atomic decomposition by basis pursuit SIAM J. Sci. Comput. 20 1 33 61 10.1137/S1064827596304010 1639094
20. Combettes, P.L.; Wajs, V.R.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4) (2005)
21. Darbon, J.; Osher, S.: Fast discrete optimization for sparse approximations and deconvolutions. Preprint, UCLA (2007)
22. I. Daubechies M. Defrise C. De Mol 2004 An iterative thresholding algorithm for linear inverse problems with a sparsity constraint Commun. Pure Appl. Math. 57 11 1413 1457 1077.65055 10.1002/cpa.20042 (Pubitemid 39427442)
23. D.L. Donoho 2006 Compressed sensing IEEE. Trans. Inf. Theory 52 1289 1306 10.1109/TIT.2006.871582 2241189
24. J. Douglas H.H. Rachford 1976 On the numerical solutions of heat conduction problems in two and three space variables Trans. Am. Math. Soc. 1 97 116
25. J. Eckstein D.P. Bertsekas 1992 On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators Math. Program. 55 293 318 0765.90073 10.1007/BF01581204 1168183
26. Esser, E.: Applications of Lagrangian-based alternating direction methods and connections to split Bregman. CAM Report 09-31, UCLA, April 2009
27. Esser, E.; Zhang, X.; Chan, T.: A general framework for a class of first order primal-dual algorithms for TV minimization. CAM Report 09-67, UCLA, August 2009
28. M.A.T. Figueiredo R.D. Nowak S.J. Wright 2007 Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems IEEE J. Sel. Top. Signal Proces. 1 4 586 597 10.1109/JSTSP.2007.910281 (Pubitemid 351276802)
29. Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems. North-Holland, Amsterdam (1983)
30. Glowinski, R.; Le Tallec, P.: Augmented Lagrangian and Operator Splitting Methods in Nonlinear Mechanics. SIAM, Philadelphia (1989)
31. Goldstein, T.; Bresson, X.; Osher, S.: Geometric applications of the split Bregman method: segmentation and surface reconstruction. UCLA CAM Report, 09-06, February (2009)
32. 1 regularized problems. SIAM J. Imag. Sci.; 2 (2009)
33. Guo, X.; Li, F.; Michael, K.Ng.: A fast L1-TV algorithm for image restoration. ICM Technical Report 08-13, Hong Kong Baptist University, November 2008
34. E.T. Hale W. Yin Y. Zhang 2008 A fixed-point continuation method for l1-regularized minimization with applications to compressed sensing SIAM J. Optim. 19 1107 1130 1180.65076 10.1137/070698920 2460734
35. M.R. Hestenes 1969 Multiplier and gradient methods J. Optim. Theory Appl. 4 303 320 0174.20705 10.1007/BF00927673 271809
36. 1-regularized least squares IEEE J. Sel. Top. Signal Proces. 1 4 606 617 10.1109/JSTSP.2007.910971 (Pubitemid 351266626)
37. Lemaréchal, C.; Sagastizábal, C.: Practical aspects of the Moreau-Yosida regularization, I: Theoretical properties (1994)
38. 1 minimization with application to compressed sensing; a greedy algorithm Inverse Probl. Imaging 3 3 487 503 1188.90196 10.3934/ipi.2009.3.487 2557916
39. Ma, S.; Goldfarb, D.; Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Technical Report, Columbia University (2008)
40. J.-J. Moreau 1962 Fonctions convexes duales et points proximaux dans un espace hilbertien C. R. Acad. Sci. Paris Ser. A Math. 255 2897 2899 0118.10502 144188
41. S. Osher M. Burger D. Goldfarb J. Xu W. Yin 2005 An iterative regularization method for total variation based image restoration Multiscale Model. Simul. 4 2 460 489 1090.94003 10.1137/040605412 2162864 (Pubitemid 43885248)
42. S. Osher Y. Mao B. Dong W. Yin 2010 Fast linearized Bregman iteration for compressive sensing and sparse denoising Commun. Math. Sci. 8 1 93 111 1190.49040 2655902
43. Powell, M.J.D.: A method for nonlinear constraints in minimization problems. Optimization (1972)
44. R.T. Rockafellar 1956 Augmented Lagrangians and applications of the proximal point algorithm in convex programming Math. Oper. Res. 82 421 439
45. L.I. Rudin S. Osher E. Fatemi 1992 Nonlinear total variation based noise removal algorithms Physica D 60 259 268 0780.49028
46. Setzer, S.: Split Bregman algorithm, Douglas-Rachford splitting and frame shrinkage. In: Morken, K.; Lysaker, M.; Lie, K.-A.; Tai, X.-C. (eds.) Scale Space and Variational Methods in Computer Vision. LNCS, vol. 5567, pp. 464-476. Springer, Berlin (2009)
47. Tai, X.-C.; Wu, C.: Augmented Lagrangian method, dual methods and split Bregman iteration for ROF model. CAM Report 09-05, UCLA, January 2009
48. Yang, J.; Zhang, Y.; Yin, W.: An efficient TV-L1 algorithm for deblurring multichannel images corrupted by impulsive noise. SIAM J. Sci. Comput. 31(4) (2009)
49. Yin, W.: Analysis and generalizations of the linearized Bregman method. CAAM Report, Rice University (2009)
50. 1 minimization with applications to compressed sensing SIAM J. Imag. Sci. 1 143 168 05256573 10.1137/070703983 2475828
51. Zhang, X.; Burger, M.; Bresson, X.; Osher, S.: Bregmanized nonlocal regularization for deconvolution and sparse reconstruction. CAM Report 09-03, UCLA, January 2009
52. Zhu, M.; Chan, T.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration. CAM Report 08-34, UCLA, May 2008ry
53. Zhu, M.; Chan, T.: An efficient primal-dual hybrid gradient algorithm for total vari