On the string averaging method for sparse common fixed-point problems

Yair Censor, Alexander Segal

Research output: Contribution to journalArticlepeer-review


We study the common fixed-point problem for the class of directed operators. This class is important because many commonly used nonlinear operators in convex optimization belong to it. We propose a definition of sparseness of a family of operators and investigate a string-averaging algorithmic scheme that favorably handles the common fixed-point problem when the family of operators is sparse. The convex feasibility problem is treated as a special case and a new subgradient projections algorithmic scheme is obtained.

Original languageEnglish
Pages (from-to)481-494
Number of pages14
JournalInternational Transactions in Operational Research
Issue number4
StatePublished - Jul 2009


  • Directed operators
  • Sparse common fixed-point problems
  • String-averaging projections

ASJC Scopus subject areas

  • Business and International Management
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Management of Technology and Innovation


Dive into the research topics of 'On the string averaging method for sparse common fixed-point problems'. Together they form a unique fingerprint.

Cite this