Abstract
Our proof of linear convergence for Dykstra’s algorithm was erroneous, and in fact, there even exists a counterexample showing that the result is false.
| Original language | English |
|---|---|
| Pages (from-to) | 1935-1938 |
| Number of pages | 4 |
| Journal | Mathematics of Operations Research |
| Volume | 50 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Aug 2025 |
Keywords
- convex problems
- dual coordinate descent
- linear convergence
- nonpolyhedral constraints
- quadratic growth
Fingerprint
Dive into the research topics of 'Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems 50(3):1935-1938. https://doi.org/10.1287/moor.2024.0500'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver