Iterative Methods for the Convex Feasibility Problem

Research output: Contribution to journalArticlepeer-review


The problem of finding a point in the intersection of a finite family of closed convex sets in the Euclidean space is considered here. Several iterative methods for its solution are reviewed and some connections between them are pointed out.

Original languageEnglish
Pages (from-to)83-91
Number of pages9
JournalNorth-Holland Mathematics Studies
Issue numberC
StatePublished - 1 Jan 1984

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Iterative Methods for the Convex Feasibility Problem'. Together they form a unique fingerprint.

Cite this