Generalization of accelerated successive projection method for convex sets intersection problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution


We consider a successive projection method for finding a common point in the intersection of closed convex sets with a nonempty interior. We first generalize an iterative projection algorithm known as acceleration method that was introduced earlier in [1] from the case of two closed convex sets to a finite number of closed convex sets, assuming that the intersection set has a nonempty interior. In particular, we establish the convergence of such an algorithm to a common feasible point in the intersection of all the sets. Following this, we establish a geometric rate of convergence for the generalized method when we restrict the convex sets to the class of half-spaces in finite dimensional Euclidean spaces.

Original languageEnglish (US)
Title of host publication2016 American Control Conference, ACC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages6
ISBN (Electronic)9781467386821
StatePublished - Jul 28 2016
Event2016 American Control Conference, ACC 2016 - Boston, United States
Duration: Jul 6 2016Jul 8 2016

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619


Other2016 American Control Conference, ACC 2016
Country/TerritoryUnited States


  • Acceleration method
  • Closed convex sets
  • Convergence rate
  • Half-spaces
  • Successive projection

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this