Abstract
In this paper, we focus on a useful modification of the decomposition method by He et al. (Ref. 1). Experience on applications has shown that the number of iterations of the original method depends significantly on the penalty parameter. The main contribution of our method is that we allow the penalty parameter to vary automatically according to some self-adaptive rules. As our numerical simulations indicate, the modified method is more flexible and efficient in practice. A detailed convergence analysis of our method is also included.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
He, B. S., Liao, L. Z., and Yang, H., Decomposition Method for a Class of Monotone Variational Inequality Problems, Journal of Optimization Theory and Applications, Vol. 103, pp. 603–622, 1999.
Glowinski, R., Numerical Methods for Nonlinear Variational Inequality Approach, Kluwer Academic Publishers, Dordrecht, Holland, 1993.
Harker, P. T., and Pang, J. S., Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms, and Applications, Mathematical Programming, Vol. 48, pp. 161–220, 1990.
He, B. S., Inexact Implicit Methods for Monotone General Variational Inequalities, Mathematical Programming, Vol. 86, pp. 199–217, 1999.
He, B. S., A Class of Projection and Contraction Methods for Monotone Variational Inequalities, Applied Mathematics and Optimization, Vol. 35, pp. 69–76, 1997.
Uzawa, H., Iterative Methods for Concave Programming, Studies in Nonlinear Programming, Edited by K. J. Arrow, L. Hurwicz, and H. Uzawa, Stanford University Press, Stanford, California, pp. 154–165, 1958.
Glowinski, R., and Le tallec, P., Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics, Studies in Applied Mathematics, SIAM, Philadelphia, Pennsylvania, 1989.
Demyanov, V. F., and Malozemov, V. N., Introduction to Minimax, John Wiley and Sons, New York, NY, 1974.
Fortin, M., and Glowinski, R., Editors, Augmented Lagrangian Methods: Applications to the Solution of Boundary-Value Problems, North Holland, Amsterdam, Holland, 1983.
Fukushima, M., Application of the Alternating Direction Method of Multiplier to Separable Conûex Programming Problems, Computational Optimization and Applications, Vol. 2, pp. 93–111, 1992.
Kontogiorgis, S., and Meyer, R. R., A Variable-Penalty Alternative Directions Method for Convex Optimization, Mathematics Programming, Vol. 83, pp. 29–53, 1998.
He, B. S., Yang, H., and Wang, S. L., Alternating Directions Method with Self-Adaptive Penalty Parameters for Monotone Variational Inequalities, Journal of Optimization Theory and Applications, Vol. 106, pp. 349–368, 2000.
Wang, S. L., Yang, H., and He, B. S., A Modified Variable-Penalty Alternating Directions Method for Monotone Variational Inequalities (submitted to Journal of Computational Mathematics).
Harker, P. T., and Pang, J. S., A Damped Newton Method for the Linear Complementarity Problem, Lectures in Applied Mathematics, Vol. 26, pp. 265–284, 1990.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
WANG, S.L., LIAO, L.Z. Decomposition Method with a Variable Parameter for a Class of Monotone Variational Inequality Problems. Journal of Optimization Theory and Applications 109, 415–429 (2001). https://doi.org/10.1023/A:1017522623963
Issue Date:
DOI: https://doi.org/10.1023/A:1017522623963