A parallel inertial proximal optimization method

Pacific Journal of Optimization

Volumn 8, Issue 2, 2012, Pages 273-306

  Pesquet, Jean Christophe ^a   Pustelnik, Nelly ^b  

^a UNIVERSITÉ PARIS EST   (France)

^b UNIVERSITÉ DE LYON   (France)

Author keywords

Convex optimization; Parallel algorithms; Proximal algorithms; Smonotone operators

Indexed keywords

EID: 84855956688     PISSN: 13489151     EISSN: 13498169     Source Type: Journal    
DOI: None     Document Type: Article

References (53)

1. M.V. Afonso, J.M. Bioucas-Dias and M.A.T. Figueiredo, Fast image recovery using variable splitting and constrained optimization, IEEE Trans. Image Process. 19 (2010) 2345-2356.
2. M.V. Afonso, J.M. Bioucas-Dias and M.A.T. Figueiredo, An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems, IEEE Trans. Image Process. 20 (2011) 681-695.
3. F. Alvarez, Weak convergence of a relaxed and inertial hybrid projection-proximal point algorithm for maximal monotone operators in Hilbert space, SIAM J. Optim. 14 (2003) 773-782.
4. F. Alvarez and H. Attouch, Convergence and asymptotic stabilization for some damped hyperbolic equations with non-isolated equilibria, ESAIM Control Optim. Calc. Var. 6 (2001) 539-552.
5. H. Attouch and M. Soueycatt, Augmented Lagrangian and proximal alternating direction methods of multipliers in Hilbert spaces-applications to games, PDEs and control, Pac. J. Optim. 5 (2009) 17-37.
6. H.H. Bauschke and P.L. Combettes, The Baillon-Haddad theorem revisited. J. Convex Anal. 17 (2010) 781-787.
7. H.H. Bauschke and P.L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer-Verlag, New York, 2011.
8. H.H. Bauschke. A note on the paper by Eckstein and Svaiter on "General projective splitting methods for sums of maximal monotone operators". SIAM J. Control Optim. 48 (2009) 2513-2515.
9. D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Athena Scientific, Belmont, MA, 1997.
10. L.M. Briceño-Arias and P.L. Combettes, Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery, Numer. Math. Theory Methods Appl. 2 (2009) 485-508.
11. F.E. Browder, Convergence theorems for sequences of nonlinear operators in Banach spaces. Math. Z. 100 (1967) 201-225.
12. Y. Censor and S.A. Zenios, Parallel Optimization: Theory, Algorithms and Applica-tions, Oxford University Press, New York, 1997.
13. C. Chaux, P.L. Combettes, J.-C. Pesquet and V.R. Wajs. A variational formulation for frame-based inverse problems, Inverse Problems 23 (2007) 1495-1518.
14. C. Chaux, L. Duval and J.-C. Pesquet, Image analysis using a dual-treeM-band wavelet transform, IEEE Trans. Image Process. 15 (2006) 2397-2412.
15. C. Chaux, J.-C. Pesquet and N. Pustelnik, Nested iterative algorithms for convex constrained image recovery problems. SIAM J. Imaging Sci. 2 (2009) 730-762.
16. P.L. Combettes, Quasi-Fejérian analysis of some optimization algorithms, in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor and S. Reich (eds), Elsevier, New York, 2001, pp. 115-152.
17. P.L. Combettes, Solving monotone inclusions via compositions of nonexpansive averaged operators, Optimization 53 (2004) 475-504.
18. P.L. Combettes, Iterative construction of the resolvent of a sum of maximal monotone operators, J. Convex Anal. 16 (2009) 727-748.
19. P.L. Combettes and J.-C. Pesquet, A Douglas-Rachford splitting approach to nonsmooth convex variational signal recovery, IEEE J. Selected Topics Signal Process. 1 (2007) 564-574.
20. P.L. Combettes and J.-C. Pesquet, Proximal thresholding algorithm for minimization over orthonormal bases, SIAM J. Optim. 18 (2007) 1351-1376.
21. P.L. Combettes and J.-C. Pesquet, A proximal decomposition method for solving convex variational inverse problems, Inverse Problems 24 (2008) 27pp.
22. P.L. Combettes and J.-C. Pesquet, Proximal splitting methods in signal processing, in Fixed-Point Algorithms for Inverse Problems in Science and Engineering, H.H. Bauschke, R. Burachik, P. L. Combettes, V. Elser, D.R. Luke and H. Wolkowicz (eds), Springer-Verlag, New York, 2010, pp. 185-212
23. P.L. Combettes and V.R. Wajs, Signal recovery by proximal forward-backward splitting, Multiscale Model. Simul. 4 (2005) 1168-1200.
24. J. Eckstein, Parallel alternating direction multiplier decomposition of convex programs, J. Optim. Theory Appl. 80 (1994) 39-62.
25. J. Eckstein and D. P. Bertsekas, On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Math. Program. 55 (1992) 293-318.
26. J. Eckstein and B. F. Svaiter, A family of projective splitting methods for the sum of two maximal monotone operators, Math. Program. 111 (2008) 173-199.
27. J. Eckstein and B.F. Svaiter, General projective splitting methods for sums of maximal monotone operators, SIAM J. Control Optim. 48 (2009) 787-811.
28. I. Ekeland and R. Témam, Convex Analysis and Variational Problems, SIAM, Philadelphia, PA, 1999.
29. E. Esser, Applications of Lagrangian-based alternating direction methods and connections to split Bregman, http://http.math.ucla.edu/pub/camreport/cam09-31.pdf, 2009.
30. M. Fortin and R. Glowinski (eds), Augmented Lagrangian Methods: Applications to the Numerical Solution of Boundary-Value Problems, North-Holland, Amsterdam, 1983.
31. D. Gabay and B. Mercier, A dual algorithm for the solution of nonlinear variational problems via finite elements approximations, Comput. Math. Appl. 2 (1976) 17-40.
32. R. Glowinski and P. Le Tallec (eds), Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, SIAM, Philadelphia, 1989.
33. T. Goldstein and S. Osher, The split Bregman method for L1-regularized problems. SIAM J. Imaging Sci. 2 (2009) 323-343.
34. S.P. Han and G. Lou, A parallel algorithm for a class of convex programs, SIAM J. Control Optim 26 (1988) 345-355.
35. P.-L. Lions and B. Mercier, Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Anal. 16 (1979) 964-979.
36. P.-E. Maingé, Inertial iterative process for fixed points of certain quasi-nonexpansive mappings. Set-Valued Anal. 15 (2007) 67-79.
37. P.-E. Maingé, Convergence theorems for inertial KM-type algorithms, J. Comput. Appl. Math. 219 (2008) 223-236.
38. P.-E. Maingé, Regularized and inertial algorithms for common fixed points of nonlinear operators, J. Math. Anal. Appl. 344 (2008) 876-887.
39. J.-J. Moreau, Proximité et dualité dans un espace hilbertien, Bull. Soc. Math. France 93 (1965) 273-299.
40. A. Moudafi, A hybrid inertial projection-proximal method for variational inequalities, Journal of Inequalities in Pure and Applied Mathematics 5 (2004) 1-5.
41. A. Moudafi and E. Elisabeth, An approximate inertial proximal method using enlargement of a maximal monotone operator, Int. J. Pure Appl. Math. 5 (2003) 283-299.
42. A. Moudafi and M. Oliny, Convergence of a splitting inertial proximal method for monotone operators, J. Comput. Appl. Math. 155 (2003) 447-454.
43. N. Pustelnik, C. Chaux and J.-C. Pesquet, Parallel ProXimal Algorithm for image restoration using hybrid regularization, IEEE Trans. Image Process. 20 (2011) 2450-2462.
44. R.T. Rockafellar, Monotone operators and the proximal point algorithm, SIAM J. Control Optim. 14 (1976) 877-898.
45. S. Setzer, G. Steidl and T. Teuber, Deblurring Poissonian images by split Bregman techniques. J. Vis. Commun. Image Represent. 21 (2010) 193-199.
46. J.E. Spingarn, Partial inverse of a monotone operator, Appl. Math. Optim. 10 (1983) 247-265.
47. J.E. Spingarn, Applications of the method of partial inverses to convex programming: decomposition, Math. Program. 32 (1985) 199-223.
48. G. Steidl and T. Teuber, Removing multiplicative noise by Douglas-Rachford splitting methods, J. Math. Imaging Vision 36 (2010) 168-184.
49. B.F. Svaiter, On weak convergence of the Douglas-Rachford method, SIAM J. Optim. 49 (2011) 280-287.
50. Z. Wang and A. C. Bovik, Mean squared error: love it or leave it? IEEE Signal Process. Mag. 26 (2009) 98-117.
51. W. Yin, S. Osher, D. Goldfarb and J. Darbon, Bregman iterative algorithms for l1-minimization with applications to compressed sensing, SIAM J. Imaging Sci. 1 (2008) 143-168.
52. X. Zhang, M. Burger, X. Bresson and S. Osher, Bregmanized nonlocal regularization for deconvolution and sparse reconstructionm, SIAM J. Imaging Sci. 3 (2010) 253-276.
53. C. Zǎlinescu, Convex Analysis in General Vector Spaces, World Scientific, River Edge, NJ, 2002.