Affiliation:
1. Department of Mathematics, The Technion—Israel Institute of Technology, 32000 Haifa, Israel
Abstract
In this work, we investigate a minimization problem with a convex objective function on a domain, which is the solution set of a common fixed point problem with a finite family of nonexpansive mappings. Our algorithm is a combination of a projected subgradient algorithm and string-averaging projection method with variable strings and variable weights. This algorithm generates a sequence of iterates which are approximate solutions of the corresponding fixed point problem. Additionally, either this sequence also has a minimizing subsequence for our optimization problem or the sequence is strictly Fejer monotone regarding the approximate solution set of the common fixed point problem.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference38 articles.
1. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales;Banach;Fund. Math.,1922
2. On the rate of convergence of iterated Bregman projections and of the alternating algorithm;Bargetz;J. Math. Anal. Appl.,2020
3. Fixed points for nonexpansive mappings and generalized nonexpansive mappings on Banach lattices;Pure Appl. Func. Anal.,2016
4. Strong and weak convergence theorems for locally nonexpansive mappings in Banach spaces;Bruck;Nonlinear Anal. Theory Methods Appl.,1982
5. Butnariu, D., Reich, S., and Zaslavski, A.J. (2006). Fixed Point Theory and Its Applications, Yokahama Publishers.