A family of projective splitting methods for the sum of two maximal monotone operators
A splitting method for two monotone operators A and B is an algorithm that attempts to converge to a zero of the sum A + B by solving a sequence of subproblems, each of which involves only the operator A, or only the operator B. Prior algorithms of this type can all in essence be categorized into three main classes, the Douglas/Peaceman-Rachford class, the forward-backward class, and the little-used double-backward class. Through a certain “extended” solution set in a product space, we construct a fundamentally new class of splitting methods for pairs of general maximal monotone operators in Hilbert space. Our algorithms are essentially standard projection methods, using splitting decomposition to construct separators. We prove convergence through Fejér monotonicity techniques, but showing Fejér convergence of a different sequence to a different set than in earlier splitting methods. Our projective algorithms converge under more general conditions than prior splitting methods, allowing the proximal parameter to vary from iteration to iteration, and even from operator to operator, while retaining convergence for essentially arbitrary pairs of operators. The new projective splitting class also contains noteworthy preexisting methods either as conventional special cases or excluded boundary cases.
Mathematics Subject Classification (2000)47H05 90C25 49M27
Unable to display preview. Download preview PDF.
- 5.Cimmino G. (1938). Calcolo approssimato per le soluzioni dei sistemi di equazioni lineari. Ric. Sci. Progr. Tecn. Econ. Naz. 1: 326–333 Google Scholar
- 7.Eckstein J. (1994). Some saddle-function splitting methods for convex programming. Optim. Meth. Softw. 4(1): 75–83 Google Scholar
- 10.Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems, chap. IX, pp. 299–340. North-Holland, Amsterdam (1983)Google Scholar
- 11.Kaczmarz S. (1937). Angenäherte auflösung von systemen linearer gleichungen. Bull. Int. Acad. Pol. Sci. A. 1937: 355–357 Google Scholar
- 12.Kaczmarz, S.: Approximate solution of systems of linear equations. Int. J. Control. 57(6), 1269–1271 (1993) (Translated from the German)Google Scholar