An iterative algorithm for approximating convex minimization problem

摘要

We suggest and analyze an iterative algorithm without the assumption of any type of commutativity on an infinite family of nonexpansive mappings. We show that the proposed iterative algorithm converges to the unique minimizer of some quadratic function over the common fixed point sets of an infinite family of nonexpansive mappings. Our result extend and improve many results announced by many authors.