On sequential and parallel projection algorithms for feasibility and optimization

Research output: Contribution to journalConference articlepeer-review


The convex feasibility problem of finding a point in the intersection of finitely many nonempty closed convex sets in the Euclidean space has many applications in various fields of science and technology, particularly in problems of image reconstruction from projections, in solving the fully discretized inverse problem in radiation therapy treatment planning, and in other image processing problems. Solving systems of linear equalities and/or inequalities is one of them. Many of the existing algorithms use projections onto the sets and may: (i) employ orthogonal-, entropy-, or other Bregman-projections, (ii) be structurally sequential, parallel, block-iterative, or of the string-averaging type, (iii) asymptotically converge when the underlying system is, or is not, consistent, (iv) solve the convex feasibility problem or find the projection of a given point onto the intersection of the convex sets, (v) have good initial behavior patterns when some of their parameters are appropriately chosen.

Original languageEnglish
Pages (from-to)1-9
Number of pages9
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - 2001
EventVisualization and Optimization Techniques - Wuhan, China
Duration: 22 Oct 200124 Oct 2001


  • Block-iterative
  • Bregman projections
  • Convex feasibility
  • Projection algorithms
  • String-averaging

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'On sequential and parallel projection algorithms for feasibility and optimization'. Together they form a unique fingerprint.

Cite this