Two algorithms for solving systems of inclusion problems
- 128 Downloads
The goal of this paper is to present two algorithms for solving systems of inclusion problems, with all components of the systems being a sum of two maximal monotone operators. The algorithms are variants of the forward-backward splitting method and one being a hybrid with the alternating projection method. They consist of approximating the solution sets involved in the problem by separating half-spaces which is a well-studied strategy. The schemes contain two parts, the first one is an explicit Armijo-type search in the spirit of the extragradient-like methods for variational inequalities. The second part is the projection step, this being the main difference between the algorithms. While the first algorithm computes the projection onto the intersection of the separating half-spaces, the second chooses one component of the system and projects onto the separating half-space of this case. In the iterative process, the forward-backward operator is computed once per inclusion problem, representing a relevant computational saving if compared with similar algorithms in the literature. The convergence analysis of the proposed methods is given assuming monotonicity of all operators, without Lipschitz continuity assumption. We also present some numerical experiments.
KeywordsArmijo-type search Maximal monotone operators Forward-backward Alternating projection Systems of inclusion problems
Mathematics Subject Classification (2010)93B40 65K15 68W25 47H05 49J40
Unable to display preview. Download preview PDF.
The author was partially supported by CNPq grant 200427/2015-6. This work was concluded while the author was visiting the School of Information Technology and Mathematical Sciences at the University of South Australia. The author would like to thank the great hospitality received during his visit, particularly to Regina S. Burachik and C. Yalçin Kaya. The author would like to express his gratitude to two anonymous referees for their valuable comments and suggestions that are very helpful to improve this paper.
- 3.Bauschke, H.H., Combettes, P.L.: Convex analysis and monotone operator theory in hilbert spaces. Springer (2011)Google Scholar
- 9.Combettes, P.L.: Fejér monotonicity in convex optimization. Encyclopedia of Optimization 1016–1024 (2009)Google Scholar
- 10.Díaz Millán, R.: On several algorithms for variational inequality and inclusion problems. PhD thesis, Federal University of Goiás, Goiânia, GO. Institute of Mathematic and Statistic, IME-UFG (2015)Google Scholar
- 12.Eckstein, J.: Splitting methods for monotone operators, with applications to parallel optimization. PhD Thesis, Massachusetts Institute of Techonology, Cambridge, MA. Report LIDS-TH-1877, Laboratory for Information and Decision Systems, M.I.T (1989)Google Scholar
- 26.Van Hieu, D., Anh, P.K., Muu, L.D.: Modified hybrid projection methods for finding common solutions to variational inequality problems. Comput. Optim. Appl. (2016)Google Scholar
- 27.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