Proximal Parallel Alternating Direction Method for Monotone Structured Variational Inequalities

In this paper, we focus on the alternating direction method, which is one of the most effective methods for solving structured variational inequalities(VI). In fact, we propose a proximal parallel alternating direction method which only needs to solve two strongly monotone sub-VI problems at each iteration. Convergence of the new method is proved under mild assumptions. We also present some preliminary numerical results, which indicate that the new method is quite efficient.

• Min Sun
• Jing Liu

• structured variational inequalities
• proximal point method
• global convergence

<p>[1] Glowinski, R.: Numerical Methods for Nonlinear Variational Problems.
Springer, New York (1984)
[2] Glowinski, R., Le Tallec, P.: Augmented Lagrangian and Operator-
Splitting Methods in Nonlinear Mechanics. SIAM Studies in Applied
Mathematics, Philadelphia (1989)
[3] Eckstin, J., Fukushima, M.: Some reformulation and applications of the
alternating direction method of multipliers. In: Hager, W.W.(ed.), Large
Scal Optimization: State of the Art. Kluwer Academic, Dordrecht (1994)
[4] He, B.S., Liao, L.Z., Han, D.R., Yang, H.: A new inexact alternating
directions method for monotone variational inequalities. Math. Program,
Ser. A 2002, 92: 103-118.
[5] He B.S.: Parallel splitting augmented Lagrangian methods for monotone
structured variational inequalities. Comput. Optim. Appl. 2009, 42: 195-
212.
[6] Yuan X.M.: An improved proximal alternating direction method for
monoton variational inequalities with separable structure. Comput. Optim.
Appl. 2011, 49(1): 17-29.
[7] Gabay, D., Applications of the method of multipliers to variational
inequalities. In: M.Fortin and R.Glowinski(Eds) Augmented Lagrange
Methods: Applications to the Solution of Boundary- valued Problems(
Ams terdam: North Holland), 299-331 (1983)
[8] Gabay, D. and Mercier, B.: A dual algorithm for the solution of nonlinear
variational problems via finite-element approximations. Computers and
Mathematics with Applications, 1976, 2: 17-40.
[9] Chen, G., Teboulle, M.: A proximal-based decomposition method for
convex minimization problem. Math. Program. 1994, 64: 81-101.
[10] Eckstein, J., Bertsekas, D.P.: On the Douglas-Rachford splitting method
and the proximal points algorithm for maximal monotone operators. Math.
Program. 1992, 55: 293-318.
[11] Fukushima, M.: Application of the alternating direction method of
multipliers to separable convex programming problems. Comput. Optim.
Appl. 1992, 2: 93-111.
[12] He, B.S., Yang, H., Wang, S.L.: Alternating direction method with
self-adaptive parameter for monotone variational inequalities. J. Optim.
Theory Appl. 2000, 106: 349-368.
[13] Pardalos, P.M., Phillips, A., Rosen, J.B.: Topics in Parallel Computing
in Mathematical Programming. Science Press, Marrickville (1992)
[14] Ye, C.H., Yuan, X.M.: A descent method for structured monotone
variational inequalities. Optimization Methods and Software, 2007, 22(2):
329-338.
[15] Jiang, Z.K., Yuan, X.M.: New parallel descent-like method for solving
a class of variational inequalities. J. Optim. Theory Appl. 2010, 145(2):
311-323.
[16] He, B.S., Wang, S.L., Yang, H.: A modified variable-penalty alternating
directions method for monotone variational inequalities. J. Comput. Math.
2003, 21: 495-504.
[17] Wang, Y.Q., Research of Corn Seeds Contour Detection Algorithm
Based on BEMD and Soft Morphology. IJCSI International Journal of
Computer Science Issues, 10(1): 664-667.</p>