Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694): Difference between revisions

The paper focuses on a networked system consisting of a finite number of participating users and considers the problem of minimizing the sum of their nondifferentiable, convex functions over the intersection of their fixed point constraint sets of quasi-nonexpansive mappings in a real Hilbert space. The author proposes a parallel subgradient method for solving the problem and describes its convergence properties for a constant step size and for a diminishing step size and the rates of convergence under certain situations. Another incremental subgradient method is proposed to solve the problem and its convergence properties for a constant step size and for a diminishing step size and the rates of convergence under certain situations are described. The two proposed methods are compared numerically with an existing method for nonsmooth convex optimization problem over the intersection of sublevel sets of convex functions.