Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems

Ion Necoara () and Olivier Fercoq ()
Additional contact information
Ion Necoara: Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania
Olivier Fercoq: Laboratoire Traitement et Communication de l’Information, Télécom Paris, Institut Polytechnique de Paris, 91120 Palaiseau, France

Mathematics of Operations Research, 2025, vol. 50, issue 3, 1935-1938

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.

Keywords: Primary: 90C25; 90C15; 65K05; convex problems; nonpolyhedral constraints; quadratic growth; dual coordinate descent; linear convergence (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/moor.2024.0500 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormoor:v:50:y:2025:i:3:p:1935-1938

Access Statistics for this article

More articles in Mathematics of Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().