On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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).
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064 · cited 1×
“According to them, that code uses the algorithm they refer to as TwIST [14] with split Bregman [50] as the substep.”
Andersen, E. D., & Andersen, K. D. (2000) · Applied Optimization · doi:10.1007/978-1-4757-3216-0_8 · Cited by 766 · cited 2×
“We wanted to compare the time needed by ART with the time needed to solve the system (17) of consistent equations for the same data by the current implementation of the interior point method of MOSEK version 5 [3].”
Cited by
Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding
O’Donoghue, B., Chu, E., Parikh, N., & Boyd, S. (2016) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-0892-3 · Cited by 664
“There are many projection algorithms that could be used to solve this kind of problem, such as the classical alternating directions method or Dykstra’s alternating projections method [16,17], amongst others [18,19].”
MethodHandbook of Mathematical Methods in Imaging
(2011) · Springer eBooks · doi:10.1007/978-0-387-92920-0 · Cited by 334
Metadata
- Authors
- Censor, Y., Chen, W., Combettes, P. L., Davidi, R., & Herman, G. T.
- Venue
- Computational Optimization and Applications
- Published
- 2011-03-17
- Volume
- 51
- Issue
- 3
- Pages
- 1065-1088
- ISSN
- 0926-6003 (ISSN-L)
- 1573-2894
- OpenAlex
- W2066333552
- Cited by
- 159
- References
- 2
- FWCI
- 11.66
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. https://app.cochat.ai/papers/10.1007/s10589-011-9401-7
- The paper
- Censor, Y., Chen, W., Combettes, P. L., Davidi, R., & Herman, G. T. (2012). On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints. Computational Optimization and Applications. https://doi.org/10.1007/s10589-011-9401-7
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.