A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- 386 Downloads
We introduce a relaxed-projection splitting algorithm for solving variational inequalities in Hilbert spaces for the sum of nonsmooth maximal monotone operators, where the feasible set is defined by a nonlinear and nonsmooth continuous convex function inequality. In our scheme, the orthogonal projections onto the feasible set are replaced by projections onto separating hyperplanes. Furthermore, each iteration of the proposed method consists of simple subgradient-like steps, which does not demand the solution of a nontrivial subproblem, using only individual operators, which exploits the structure of the problem. Assuming monotonicity of the individual operators and the existence of solutions, we prove that the generated sequence converges weakly to a solution.
KeywordsPoint-to-set operator Projection methods Relaxed method Splitting methods Variational inequality problem Weak convergence
Mathematics Subject Classification90C47 49J35
JYBC and RDM were partially supported by project CAPES-MES-CUBA 226/2012. JYBC was partially supported by CNPq grants 303492/2013-9, 474160/2013-0 and 202677/2013-3 and by project UNIVERSAL FAPEG/CNPq. RDM was supported by his scholarship for his doctoral studies, granted by CAPES. This work was completed while the first author was visiting the University of British Columbia. The author is very grateful for the warm hospitality. The authors would like to thank to Professor Dr. Heinz H. Bauschke, Professor Dr. Ole Peter Smith and anonymous referees whose suggestions helped us to improve the presentation of this paper.
- 17.Combettes, P.L.: Quasi-Fejérian analysis of some optimization algorithms. In: Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Studies in Computational Mathematics 8, North-Holland, Amsterdam, pp. 115–152 (2001)Google Scholar
- 27.Iusem, A.N., Svaiter, B.F.: A variant of Korpelevich’s method for variational inequalities with a new search strategy. Optimization 42, 309–321 (1997) (Addendum Optimization 43, 85 (1998))Google Scholar
- 33.Lewis, A.S., Pang, J.-S.: Error Bounds for Convex Inequality Systems. Generalized Convexity, Generalized Monotonicity: Recent Results: Nonconvex Optimization and Its Applications, Vol. 27, pp. 75–110. Kluwer Academic Publications, Dordrecht (1998)Google Scholar
- 49.Zarantonello, E.H.: Projections on convex sets in Hilbert space and spectral theory. In: Zarantonello, E. (ed.) Contributions to Nonlinear Functional Analysis, pp. 237–424. Academic Press, New York (1971)Google Scholar