Abstract
In the alternating directions method, the relaxation factor \(\gamma\in(0,\frac{\sqrt{5}+1}{2})\) by Glowinski is useful in practical computations for structured variational inequalities. This paper points out that the same restriction region of the relaxation factor is also valid in the proximal alternating directions method.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Glowinski, R.: Numerical Methods for Nonlinear Variational Problems. Springer, New York (1984)
Glowinski, R., Le Tallec, P.: Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics. SIAM Studies in Applied Mathematics, Philadelphia (1989)
Eckstein, J.: Some saddle-function splitting methods for convex programming. Optim. Methods Softw. 4, 75–83 (1994)
Eckstein, J., Fukushima, M.: Some reformulation and applications of the alternating direction method of multipliers. In: Hager, W.W. (ed.), Large Scale Optimization: State of the Art. Kluwer Academic, Dordrecht (1994)
Fukushima, M.: Application of the alternating direction method of multipliers to separable convex programming problems. Comput. Optim. Appl. 2, 93–111 (1992)
He, B.S., Yang, H.: Some convergence properties of a method of multipliers for linearly constrained monotone variational inequalities. Oper. Res. Lett. 23, 151–161 (1998)
Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite-element approximations. Comput. Math. Appl. 2, 17–40 (1976)
Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrange Methods: Applications to the Solution of Boundary-valued Problems, pp. 299–331. North Holland, Amsterdam (1983)
Kontogiorgis, S., Meyer, R.R.: A variable-penalty alternating directions method for convex optimization. Math. Program. 83, 29–53 (1998)
Teboulle, M.: Convergence of proximal-like algorithms. SIAM J. Optim. 7, 1069–1083 (1997)
Tseng, P.: Applications of splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29, 119–138 (1991)
He, B.S., Wang, S.L., Yang, H.: A modified variable-penalty alternating directions method for monotone variational inequalities. J. Comput. Math. 21, 495–504 (2003)
Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)
Martinet, B.: Regularization d’inequations variationelles par approximations sucessives. Rev. Francaise Inform. Rech. Oper. 4, 154–159 (1970)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by X.Q. Yang.
The research was supported by the NSFC of China Grant 10571083 and MOEC Grant 20060284001. The author thanks the anonymous referees for valuable suggestions.
Rights and permissions
About this article
Cite this article
Xu, M.H. Proximal Alternating Directions Method for Structured Variational Inequalities. J Optim Theory Appl 134, 107–117 (2007). https://doi.org/10.1007/s10957-007-9192-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-007-9192-2