On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computational Optimization and Applications Year : 2011

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).

Keywords

Dates and versions

hal-00643783 , version 1 (22-11-2011)

Identifiers

Cite

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, 2011, ⟨10.1007/s10589-011-9401-7⟩. ⟨hal-00643783⟩
58 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More