Computing Fixed points for totally nonexpansive operators and applications to

Prof. Dan Butnariu (University of Haifa, Israel)

The topic we discuss concerns the convergence of iterative algorithms for finding almost common fixed points of measurable families of totally nonexpansive operators. We present classes of optimization and feasibility problems which are reducible to finding such almost common fixed points and we show that under quite mild conditions one can apply these algorithms for solving those problems.