We propose the split common fixed point problem that requires to find a common fixed point of a family of operators in one space whose image under a linear transformation is a common fixed point of… Expand

Component averaging (CAV) is introduced as a new iterative parallel technique suitable for large and sparse unstructured systems of linear equations.Expand

Foreword Preface Glossary of Symbols 1. Introduction Part I Theory 2. Generalized Distances and Generalized Projections 3. Proximal Minimization with D-Functions Part II Algorithms 4. Penalty… Expand

Abstract An iterative method is proposed for solving convex feasibility problems. Each iteration is a convex combination of projections onto the given convex sets where the weights of the combination… Expand

Series-expansion reconstruction methods made their first appearance in the scientific literature and in the CT scanner industry around 1970. Great research efforts have gone into them since but many… Expand

The iterative primal-dual method of Bregman for solving linearly constrained convex programming problems, which utilizes nonorthogonal projections onto hyperplanes, is represented in a compact form,… Expand

This paper brings together and discusses theory and applications of methods, identified and labelled as row-action methods, for linear feasibility problems (find $x \in {\bf R}^n $, such that $Ax… Expand