A new primal-dual algorithm with memory-based proximal centers attains O(1/N) ergodic convergence, but its claimed O(1/N^2) accelerated rate rests on a square-root error.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
New Primal-Dual Algorithm for Convex Problems
A new primal-dual algorithm with memory-based proximal centers attains O(1/N) ergodic convergence, but its claimed O(1/N^2) accelerated rate rests on a square-root error.