Abstract
Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches for convex optimization problems and monotone variational inequalities. In Part I of this paper (He et al. in Proximal-like contraction methods for monotone variational inequalities in a unified framework I: effective quadruplet and primary methods, 2010), we proposed a unified framework consisting of an effective quadruplet and a corresponding accepting rule. Under the framework, various existing APPAs can be grouped in the same class of methods (called primary or elementary methods) which adopt one of the geminate directions in the effective quadruplet and take the unit step size. In this paper, we extend the primary methods by using the same effective quadruplet and the accepting rule. The extended (general) contraction methods need only minor extra even negligible costs in each iteration, whereas having better properties than the primary methods in sense of the distance to the solution set. A set of matrix approximation examples as well as six other groups of numerical experiments are constructed to compare the performance between the primary (elementary) and extended (general) methods. As expected, the numerical results show the efficiency of the extended (general) methods are much better than that of the primary (elementary) ones.
Similar content being viewed by others
References
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation, Numerical Methods. Prentice-Hall, Englewood Cliffs (1989)
Blum, E., Oettli, W.: Mathematische Optimierung. Grundlagen und Verfahren. Ökonometrie und Unternehmensforschung. Springer, Berlin (1975)
Eckstein, J.: Nonlinear proximal point algorithms using Bregman functions, with applications to convex programing. Math. Oper. Res. 18, 202–226 (1993)
Eckstein, J.: Approximate iterations in Bregman-function-based proximal algorithms. Math. Program. 83, 113–123 (1998)
Gao, Y., Sun, D.F.: Calibrating least squares covariance matrix problems with equality and inequality constraints. SIAM J. Matrix Anal. Appl. 31, 1432–1457 (2009)
Golub, G.H., van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)
Harker, P.T., Pang, J.S.: A Damped-Newton method for the linear complementarity problem. Lect. Appl. Math. 26, 265–284 (1990)
He, S.B., Liao, L.-Z.: Improvements of some projection methods for monotone nonlinear variational inequalities. J. Optim. Theory Appl. 112, 111–128 (2002)
He, B.S., Liao, L.-Z., Han, D.R., Yang, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. 92, 103–118 (2002)
He, B.S., Yang, Z.H., Yuan, X.M.: An approximate proximal-extragradient type method for monotone variational inequalities. J. Math. Anal. Appl. 300, 362–374 (2004)
He, B.S., Yuan, X.M., Zhang, J.J.Z.: Comparison of two kinds of prediction-correction methods for monotone variational inequalities. Comput. Optim. Appl. 27, 247–267 (2004)
He, B.S., Liao, L.-Z., Wang, X.: Proximal-like contraction methods for monotone variational inequalities in a unified framework I: effective quadruplet and primary methods (2010, preprint)
Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97–116 (1976)
Solodov, M.V., Svaiter, B.F.: Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math. Program. 88, 371–389 (2000)
Taji, K., Fukushima, M., Ibaraki, I.: A globally convergent Newton method for solving strongly monotone variational inequalities. Math. Program. 58, 369–383 (1993)
Zhu, T., Yu, Z.G.: A simple proof for some important properties of the projection mapping. Math. Inequal. Appl. 7, 453–456 (2004)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (Grant No. 10971095), the Natural Science Foundation of Jiangsu Province (BK2008255), the Cultivation Fund of the Key Scientific and Technical Innovation Project, Ministry of Education of China (708044), and the Research Grant Council of Hong Kong.
Rights and permissions
About this article
Cite this article
He, B., Liao, LZ. & Wang, X. Proximal-like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments. Comput Optim Appl 51, 681–708 (2012). https://doi.org/10.1007/s10589-010-9373-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-010-9373-z