Optimization on Solution Sets of Common Fixed Point Problems with a Countable Family of Maps
摘要
In this paper we apply the subgradient algorithm in order to solve an optimization problem on the solution set of a common fixed point problem with a countable family of mappings. It is shown that our algorithm generates iterates which converge to the set of minimizers.