Accelerating convergence of a class of splitting algorithms with iterative foldings (Q2390719)

The authors analyze the asymptotic convergence properties of one class of splitting algorithms. The concept of proto-differentiability is defined and some of its properties are proved. A general case of the splitting algorithms, in which the subdifferential operators are proto-differentiable is investigated. New convergence bounds are derived and a geometric interpretation of the algorithms is given. A convergence acceleration of the considered algorithms is discussed. Numerical results confirming good convergence properties of the algorithms are presented in the last section of the paper.