Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems 50(3):1935-1938. https://doi.org/10.1287/moor.2024.0500

Ion Necoara; Olivier Fercoq

doi:10.1287/moor.2024.0500

Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems 50(3):1935-1938. https://doi.org/10.1287/moor.2024.0500

Ion Necoara
, Olivier Fercoq

University 'Politehnica' of Bucharest

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

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.

langue originale	Anglais
Pages (de - à)	1935-1938
Nombre de pages	4
journal	Mathematics of Operations Research
Volume	50
Numéro de publication	3
Les DOIs	https://doi.org/10.1287/moor.2024.0500
état	Publié - 1 août 2025

Accès au document

10.1287/moor.2024.0500

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@article{fd0a950a1270477d8fc11753a1a10cea,

title = "Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems 50(3):1935-1938. https://doi.org/10.1287/moor.2024.0500",

abstract = "Our proof of linear convergence for Dykstra{\textquoteright}s algorithm was erroneous, and in fact, there even exists a counterexample showing that the result is false.",

keywords = "convex problems, dual coordinate descent, linear convergence, nonpolyhedral constraints, quadratic growth",

author = "Ion Necoara and Olivier Fercoq",

note = "Publisher Copyright: {\textcopyright} 2024 INFORMS.",

year = "2025",

month = aug,

day = "1",

doi = "10.1287/moor.2024.0500",

language = "English",

volume = "50",

pages = "1935--1938",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

number = "3",

}

TY - JOUR

T1 - Erratum to

T2 - Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems 50(3):1935-1938. https://doi.org/10.1287/moor.2024.0500

AU - Necoara, Ion

AU - Fercoq, Olivier

PY - 2025/8/1

Y1 - 2025/8/1

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

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

KW - convex problems

KW - dual coordinate descent

KW - linear convergence

KW - nonpolyhedral constraints

KW - quadratic growth

UR - https://www.scopus.com/pages/publications/105014268857

U2 - 10.1287/moor.2024.0500

DO - 10.1287/moor.2024.0500

M3 - Article

AN - SCOPUS:105014268857

SN - 0364-765X

VL - 50

SP - 1935

EP - 1938

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 3

ER -

Erratum to: Linear Convergence of Dual Coordinate Descent on Nonpolyhedral Convex Problems 50(3):1935-1938. https://doi.org/10.1287/moor.2024.0500

Résumé

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation