Averaging strings of sequential iterations for convex feasibility problems

Y. Censor, T. Elfving, G. T. Herman

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


An algorithmic scheme for the solution of convex feasibility problems is proposed inwhich the end-points of strings of sequential projections onto the constraints are averaged. The scheme, employing Bregman projections, is analyzed with the aid of an extended product space formalism. For the case of orthogonal projections we give also a relaxed version. Along with the well-known purely sequential and fully simultaneous cases, the new scheme includes many other inherently parallel algorithmic options depending on the choice of strings. Convergence in the consistent case is proven and an application to optimization over linear inequalities is given.

Original languageEnglish
Title of host publicationStudies in Computational Mathematics
Number of pages13
StatePublished - 2001

Publication series

NameStudies in Computational Mathematics
ISSN (Print)1570-579X

ASJC Scopus subject areas

  • Computational Mathematics


Dive into the research topics of 'Averaging strings of sequential iterations for convex feasibility problems'. Together they form a unique fingerprint.

Cite this