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

Yair Censor; Wei Chen; Patrick L. Combettes; Ran Davidi; Gabor T. Herman; W. Chen; R. Davidi; G. T. Herman; P. L. Combettes

doi:10.1007/s10589-011-9401-7

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

Yair Censor, Wei Chen, Patrick L. Combettes, Ran Davidi, Gabor T. Herman, W. Chen, R. Davidi, G. T. Herman, P. L. Combettes

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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

Original language	English
Pages (from-to)	1065-1088
Number of pages	24
Journal	Computational Optimization and Applications
Volume	51
Issue number	3
DOIs	https://doi.org/10.1007/s10589-011-9401-7
State	Published - Apr 2012

Bibliographical note

Funding Information:
Acknowledgements The work of Y. Censor, W. Chen, R. Davidi, and G.T. Herman was supported by NIH Award Number R01HL070472 from the National Heart, Lung, and Blood Institute. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Heart, Lung, and Blood Institute or the National Institutes of Health. The work of P.L. Combettes was supported by the Agence Nationale de la Recherche under grant ANR-08-BLAN-0294-02. The work of Y. Censor was also supported by United States-Israel Binational Science Foundation (BSF) Grant number 200912. We thank the Department of Radiation Oncology, Massachusetts General Hospital and Harvard Medical School (and especially David Craft) for providing access to their computers. We are also grateful to T. Goldstein and S. Osher of UCLA for providing us with the optimization code [51] that they considered most appropriate for solving (24).

Keywords

Convex feasibility problems
Linear inequalities
Numerical evaluation
Optimization
Projection methods
Sparse matrices

ASJC Scopus subject areas

Control and Optimization
Computational Mathematics
Applied Mathematics

Access to Document

10.1007/s10589-011-9401-7

Cite this

@article{ebdcfb4289a9442d945dfed59a69a123,

title = "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 = "Convex feasibility problems, Linear inequalities, Numerical evaluation, Optimization, Projection methods, Sparse matrices",

author = "Yair Censor and Wei Chen and Combettes, {Patrick L.} and Ran Davidi and Herman, {Gabor T.} and W. Chen and R. Davidi and Herman, {G. T.} and Combettes, {P. L.}",

note = "Funding Information: Acknowledgements The work of Y. Censor, W. Chen, R. Davidi, and G.T. Herman was supported by NIH Award Number R01HL070472 from the National Heart, Lung, and Blood Institute. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Heart, Lung, and Blood Institute or the National Institutes of Health. The work of P.L. Combettes was supported by the Agence Nationale de la Recherche under grant ANR-08-BLAN-0294-02. The work of Y. Censor was also supported by United States-Israel Binational Science Foundation (BSF) Grant number 200912. We thank the Department of Radiation Oncology, Massachusetts General Hospital and Harvard Medical School (and especially David Craft) for providing access to their computers. We are also grateful to T. Goldstein and S. Osher of UCLA for providing us with the optimization code [51] that they considered most appropriate for solving (24).",

year = "2012",

month = apr,

doi = "10.1007/s10589-011-9401-7",

language = "English",

volume = "51",

pages = "1065--1088",

journal = "Computational Optimization and Applications",

issn = "0926-6003",

publisher = "Springer",

number = "3",

}

TY - JOUR

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

AU - Censor, Yair

AU - Chen, Wei

AU - Combettes, Patrick L.

AU - Davidi, Ran

AU - Herman, Gabor T.

AU - Chen, W.

AU - Davidi, R.

AU - Herman, G. T.

AU - Combettes, P. L.

N1 - Funding Information: Acknowledgements The work of Y. Censor, W. Chen, R. Davidi, and G.T. Herman was supported by NIH Award Number R01HL070472 from the National Heart, Lung, and Blood Institute. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Heart, Lung, and Blood Institute or the National Institutes of Health. The work of P.L. Combettes was supported by the Agence Nationale de la Recherche under grant ANR-08-BLAN-0294-02. The work of Y. Censor was also supported by United States-Israel Binational Science Foundation (BSF) Grant number 200912. We thank the Department of Radiation Oncology, Massachusetts General Hospital and Harvard Medical School (and especially David Craft) for providing access to their computers. We are also grateful to T. Goldstein and S. Osher of UCLA for providing us with the optimization code [51] that they considered most appropriate for solving (24).

PY - 2012/4

Y1 - 2012/4

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

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

KW - Convex feasibility problems

KW - Linear inequalities

KW - Numerical evaluation

KW - Optimization

KW - Projection methods

KW - Sparse matrices

UR - http://www.scopus.com/inward/record.url?scp=84862006524&partnerID=8YFLogxK

U2 - 10.1007/s10589-011-9401-7

DO - 10.1007/s10589-011-9401-7

M3 - Article

AN - SCOPUS:84862006524

SN - 0926-6003

VL - 51

SP - 1065

EP - 1088

JO - Computational Optimization and Applications

JF - Computational Optimization and Applications

IS - 3

ER -

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

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this