• Publications
  • Influence
A multiprojection algorithm using Bregman projections in a product space
We show here that a multiprojection algorithm converges on a convex feasibility problem using the product space formalism of Pierra. Expand
  • 793
  • 101
The Split Common Fixed Point Problem for Directed Operators.
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 ofExpand
  • 183
  • 52
  • PDF
Parallel Optimization:theory
  • 194
  • 26
Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
Component averaging (CAV) is introduced as a new iterative parallel technique suitable for large and sparse unstructured systems of linear equations. Expand
  • 215
  • 23
Algorithms for the Split Variational Inequality Problem
We propose a prototypical Split Inverse Problem (SIP) and a new variational problem, called the Split Variational Inequality problem (SVIP). Expand
  • 301
  • 21
  • PDF
Parallel Optimization: Theory, Algorithms, and Applications
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. PenaltyExpand
  • 387
  • 19
  • PDF
Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
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 combinationExpand
  • 154
  • 18
Finite series-expansion reconstruction methods
  • Y. Censor
  • Mathematics
  • Proceedings of the IEEE
  • 1 March 1983
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 manyExpand
  • 423
  • 17
An iterative row-action method for interval convex programming
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
  • 387
  • 17
Row-Action Methods for Huge and Sparse Systems and Their Applications
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 $AxExpand
  • 416
  • 14