Convergence Analysis and Applications of the Glowinski–Le Tallec Splitting Method for Finding a Zero of the Sum of Two Maximal Monotone Operators

Many problems of convex programming can be reduced to finding a zero of the sum of two maximal monotone operators. For solving this problem, there exists a variety of methods such as the forward–backward method, the Peaceman–Rachford method, the Douglas–Rachford method, and more recently the θ-scheme. This last method has been presented without general convergence analysis by Glowinski and Le Tallec and seems to give good numerical results. The purpose of this paper is first to present convergence results and an estimation of the rate of convergence for this recent method, and then to apply it to variational inequalities and structured convex programming problems to get new parallel decomposition algorithms.

[1]  H. H. Rachford,et al.  The Numerical Solution of Parabolic and Elliptic Differential Equations , 1955 .

[2]  H. H. Rachford,et al.  On the numerical solution of heat conduction problems in two and three space variables , 1956 .

[3]  R. Rockafellar.  On the maximality of sums of nonlinear monotone operators , 1970 .

[4]  H. Brezis.  Opérateurs maximaux monotones et semi-groupes de contractions dans les espaces de Hilbert , 1973 .

[5]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

[6]  Gregory B. Passty.  Ergodic convergence to a zero of the sum of monotone operators in Hilbert space , 1979 .

[7]  P. Lions,et al.  Splitting Algorithms for the Sum of Two Nonlinear Operators , 1979 .

[8]  D. Gabay.  Applications of the method of multipliers to variational inequalities , 1983 .

[9]  R. Glowinski,et al.  Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics , 1987 .

[10]  Patrick Le Tallec,et al.  Numerical analysis of viscoelastic problems , 1990 .

[11]  Paul Tseng,et al.  Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming , 1990, Math. Program..

[12]  P. Tseng.  Applications of splitting algorithm to decomposition in convex programming and variational inequalities , 1991 .

[13]  J. Strodiot,et al.  A perturbed parallel decomposition method for a class of nonsmooth convex minimization problems , 1991 .

[14]  Dimitri P. Bertsekas,et al.  On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators , 1992, Math. Program..

[15]  Roberto Cominetti,et al.  Convex Functions with Unbounded Level Sets and Applications to Duality Theory , 1993, SIAM J. Optim..

[16]  P. D. Tao,et al.  Partial regularization of the sum of two maximal monotone operators , 1993 .

[17]  Marc Teboulle,et al.  A proximal-based decomposition method for convex minimization problems , 1994, Math. Program..

[18]  Masao Fukushima,et al.  Some Reformulations and Applications of the Alternating Direction Method of Multipliers , 1994 .

[19]  Tao Pham Dinh,et al.  Proximal Decomposition on the Graph of a Maximal Monotone Operator , 1995, SIAM J. Optim..

[20]  Ciyou Zhu.  Asymptotic Convergence Analysis of the Forward-Backward Splitting Algorithm , 1995, Math. Oper. Res..

[21]  Masao Fukushima,et al.  A parallel descent algorithm for convex programming , 1996, Comput. Optim. Appl..