Dykstra′s Alternating Projection Algorithm for Two Sets
Open accessThe DOI matches its Crossref record.
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
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
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].”
Method(2001) · Studies in Computational Mathematics · doi:10.1016/s1570-579x(01)80028-8 · Cited by 610
Relaxed averaged alternating reflections for diffraction imaging
Luke, D. R. (2005) · Inverse Problems · doi:10.1088/0266-5611/21/1/004 · Cited by 551
Solving monotone inclusions via compositions of nonexpansive averaged operators
Combettes *, P. L. (2004) · Optimization · doi:10.1080/02331930412331327157 · Cited by 457
Metadata
- Authors
- Bauschke, H. H., & Borwein, J. M.
- Venue
- Journal of Approximation Theory
- Publisher
- Elsevier BV
- Published
- 1994-12
- Volume
- 79
- Issue
- 3
- Pages
- 418-443
- ISSN
- 0021-9045 (ISSN-L)
- OpenAlex
- W2004328411
- Cited by
- 181
- References
- 0
- FWCI
- 2.42
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.