Skip to Main content Skip to Navigation
Journal articles

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

Abstract : The 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).
keyword : sadco
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/hal-00643783
Contributor : Estelle Bouzat Connect in order to contact the contributor
Submitted on : Tuesday, November 22, 2011 - 5:43:45 PM
Last modification on : Sunday, June 26, 2022 - 5:17:46 AM

Links full text

Identifiers

Citation

yair Censor, Wei Chen, Patrick Louis Combettes, Ran Davidi, Gabor T. Herman. On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Computational Optimization and Applications, Springer Verlag, 2011, ⟨10.1007/s10589-011-9401-7⟩. ⟨hal-00643783⟩

Share

Metrics

Record views

55