Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions

Optimization

Volumn 64, Issue 5, 2015, Pages 1239-1261

  Briceño Arias, Luis M ^a  

^a DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

composite operator; convex optimization; minimization algorithm; monotone inclusion; partial inverse; splitting methods

Indexed keywords

EID: 84924242240     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331934.2013.855210     Document Type: Article

References (48)

1. Combettes PL, Pesquet J-C. A proximal decomposition method for solving convex variational inverse problems. Inverse Prob. 2008;24:065014, 27p.
2. Spingarn JE. Applications of the method of partial inverses to convex programming: decomposition. Math. Program. 1985;32:199–223.
3. Lions J-L, Stampacchia G. Variational inequalities. Comm. Pure Appl. Math. 1967;20:493–519.
4. Tseng P. Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming. Math. Program. 1990;48:249–263.
5. Tseng P. Applications of a splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 1991;29:119–138.
6. Eckstein J, Bertsekas DP. On the Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 1992;55:293–318.
7. Lions P-L, Mercier B. Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 1979;16:964–979.
8. Rockafellar RT. Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 1976;14:877–898.
9. Spingarn JE. Partial inverse of a monotone operator. Appl. Math. Optim. 1983;10:247–265.
10. Fortin M, Glowinski R. Augmented Lagrangian methods: applications to the numerical solution of boundary value problems. Amsterdam: North-Holland; 1983.
11. Glowinski R, Le Tallec P. Augmented Lagrangian and operator-splitting methods in nonlinear mechanics. Philadelphia (PA): SIAM; 1989.
12. Mercier B. Inéquations Variationnelles de la Mécanique (Publications Mathématiques d’Orsay, no. 80.01). Orsay, France: Université de Paris-XI; 1980.
13. Zeidler E. Nonlinear functional analysis and its applications II/B-nonlinear monotone operators. New York (NY): Springer-Verlag; 1990.
14. Jofré A, Rockafellar RT, Wets RJ-B. Variational inequalities and economic equilibrium. Math. Oper. Res. 2007;32:32–50.
15. Pennanen T. Introduction to convex optimization in financial markets. Math. Program. 2012;134:157–186.
16. Aujol J-F, Gilboa G, Chan T, Osher S. Structure-texture image decomposition – modeling, algorithms, and parameter selection. Int. J. Comput. Vis. 2006;67:111–136.
17. Byrne CL. Iterative oblique projection onto convex sets and the split feasibility problem. Inverse Prob. 2002;18:441–453.
18. Chambolle A, Lions PL. Image recovery via total variation minimization and related problems. Numer. Math. 1997;76:167–188.
19. Daubechies I, Defrise M, De Mol C. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math. 2004;57:1413–1457.
20. Eicke B. Iteration methods for convexly constrained ill-posed problems in Hilbert space. Numer. Funct. Anal. Optim. 1992;13:413–429.
21. Sabharwal A, Potter LC. Convexly constrained linear inverse problems: iterative least-squares and regularization. IEEE Trans. Signal Process. 1998;46:2345–2352.
22. Aubin J-P, Frankowska H. Set-valued analysis. Boston (MA): Birkhäuser; 1990.
23. Haraux A. Nonlinear evolution equations: global behavior of solutions. Vol. 841, Lecture Notes in Math. New York (NY): Springer-Verlag; 1981.
24. Showalter RE. Monotone operators in Banach space and nonlinear partial differential equations. Vol. 49, Mathematical Surveys and Monographs. Providence (RI): American Mathematical Society; 1997.
25. Beckmann M, McGuire C, Winsten C. Studies in economics of transportation. New Haven (CT): Yale University Press; 1956.
26. Bertsekas DP, Gafni EM. Projection methods for variational inequalities with application to the traffic assignment problem. Math. Program. Stud. 1982;17:139–159.
27. Fukushima M. The primal Douglas–Rachford splitting algorithm for a class of monotone mappings with applications to the traffic equilibrium problem. Math. Program. 1996;72:1–15.
28. Rockafellar RT. Network flows and monotropic optimization. New York (NY): Wiley; 1984.
29. Sheffi Y. Urban transportation networks: equilibrium analysis with mathematical programming methods. Englewood Cliffs (NJ): Prentice-Hall; 1985.
30. Combettes PL. Solving monotone inclusions via compositions of nonexpansive averaged operators. Optimization. 2004;53:475–504.
31. Passty GB. Ergodic convergence to a zero of the sum of monotone operators in Hilbert space. J. Math. Anal. Appl. 1979;72:383–390.
32. Briceño-Arias LM, Combettes PL. A monotone+skew splitting model for composite monotone inclusions in duality. SIAM J. Optim. 2011;21:1230–1250.
33. Combettes PL. Iterative construction of the resolvent of a sum of maximal monotone operators. J. Convex Anal. 2009;16:727–748.
34. Combettes PL, Pesquet J-C. Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Valued Var. Anal. 2012;20:307–330.
35. Vũ BC. A splitting algorithm for dual monotone inclusions involving cocoercive operators. Adv. Comput. Math. 2013;38:667–681.
36. Svaiter BF. On weak convergence of the Douglas–Rachford method. SIAM J. Control Optim. 2011;49:280–287.
37. Bauschke HH, Combettes PL. Convex analysis and monotone operator theory in Hilbert spaces. New York (NY): Springer-Verlag; 2011.
38. Zălinescu C. Convex analysis in general vector spaces. River Edge (NJ): World Scientific; 2002.
39. Krasnosel’skiĭ MA. Two remarks on the method of successive approximations. Uspehi Mat. Nauk (N.S.). 1955;10:123–127.
40. Mann WR. Mean value methods in iteration. Proc. Am. Math. Soc. 1953;4:506–510.
41. Combettes PL. Quasi–Fejérian analysis of some optimization algorithms. In: Butnariu D, Censor Y, Reich S, editors. Inherently parallel algorithms for feasibility and optimization. Amsterdam: Elsevier; 2001. p. 115–152.
42. Attouch H, Briceño-Arias LM, Combettes PL. A parallel splitting method for coupled monotone inclusions. SIAM J. Control Optim. 2010;48:3246–3270.
43. Raguet H, Fadili J, Peyré G. Generalized forward–-backward splitting. SIAM J. Imaging Sci. 2013;6:1199–1226.
44. Briceño-Arias LM, Combettes PL. Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery. Numer. Math. Theory Methods Appl. 2009;2:485–508.
45. Briceño-Arias LM, Combettes PL, Pesquet J-C, Pustelnik N. Proximal algorithms for multicomponent image processing. J. Math. Imaging Vision. 2011;41:3–22.
46. Baillon J-B, Haddad G. Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones. Israel J. Math. 1977;26:137–150.
47. Bauschke HH, Combettes PL. The Baillon–Haddad theorem revisited. J. Convex Anal. 2010;17:781–787.
48. Condat L. A generic first-order primal-dual method for convex optimization involving Lipschitzian, proximable and linear composite terms. Available from: http://hal.archives-ouvertes.fr/hal-00609728/en/.