Abstract
Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches for convex optimization problems and monotone variational inequalities. To solve the subproblems of these algorithms, the projection method takes the iteration in form of u k+1=P Ω [u k−α k d k]. Interestingly, many of them can be paired such that \(\tilde{u}^{k} = P_{\varOmega}[u^{k} - \beta_{k}F(v^{k})] = P_{\varOmega}[\tilde {u}^{k} - (d_{2}^{k} - G d_{1}^{k})]\), where inf {β k }>0 and G is a symmetric positive definite matrix. In other words, this projection equation offers a pair of directions, i.e., \(d_{1}^{k}\) and \(d_{2}^{k}\) for each step. In this paper, for various APPAs we present a unified framework involving the above equations. Unified characterization is investigated for the contraction and convergence properties under the framework. This shows some essential views behind various outlooks. To study and pair various APPAs for different types of variational inequalities, we thus construct the above equations in different expressions according to the framework. Based on our constructed frameworks, it is interesting to see that, by choosing one of the directions (\(d_{1}^{k}\) and \(d_{2}^{k}\)) those studied proximal-like methods always utilize the unit step size namely α k ≡1.
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)
Dai, Y.H., Yuan, Y.: Alternate minimization gradient method. IMA J. Numer. Anal. 23, 377–393 (2003)
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)
Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, vol. I. Springer, New York (2003)
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, PA (1989)
He, B.S.: Some predict-correct projection methods for monotone variational inequalities. Report 95-68, Faculty of Technical Mathematics and Informatics, Delf University of Technology (1995)
He, B.S., 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., Liao, L.-Z., Qian, M.J.: Alternating projection based prediction-correction methods for structured variational inequalities. J. Comput. Math. 24, 693–710 (2006)
He, B.S., Liao, L.-Z., Wang, X.: Proximal-like contraction methods for monotone variational inequalities in a unified framework II: General methods and numerical experiments. To appear in COAP
He, B.S., Xu, M.H.: A general framework of contraction methods for monotone variational inequalities. Pac. J. Optim. 4, 195–212 (2008)
Khobotov, E.N.: Modification of the extragradient method for solving variational inequalities and certain optimization problems. USSR Comput. Math. Phys. 27, 120–127 (1987)
Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Ekon. Mat. Metody 12, 747–756 (1976)
Rockafellar, R.T.: Augmented Lagrangians and applications of the proximal point algorithm in convex programming. Math. Oper. Res. 1, 97–116 (1976)
Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)
Solodov, M.V., Svaiter, B.F.: A hybrid projection-proximal point algorithm. J. Convex Anal. 6, 59–70 (1999)
Solodov, M.V., Svaiter, B.F.: Error bounds for proximal point subproblems and associated inexact proximal point algorithms. Math. Program. 88, 371–389 (2000)
Tseng, P.: A modified forward-backword splitting method for maximal monotone mappings. SIAM J. Control Optim. 38, 431–446 (2000)
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 I: Effective quadruplet and primary methods. Comput Optim Appl 51, 649–679 (2012). https://doi.org/10.1007/s10589-010-9372-0
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10589-010-9372-0