Skip to main content
Article thumbnail
Location of Repository

On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints

By Yair Censor, Wei Chen, Patrick Louis Combettes, Ran Davidi and Gabor Herman


International audienceThe effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they often have a computational advantage over alternatives that have been proposed for solving the same problem and that this makes them successful in many real-world applications. This is supported by experimental evidence provided in this paper on problems of various sizes (up to tens of thousands of unknowns satisfying up to hundreds of thousands of constraints) and by a discussion of the demonstrated efficacy of projection methods in numerous scientific publications and commercial patents (dealing with problems that can have over a billion unknowns and a similar number of constraints)

Topics: sadco
Publisher: Springer Verlag
Year: 2011
DOI identifier: 10.1007/s10589-011-9401-7
OAI identifier: oai:HAL:hal-00643783v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.