Stochastic moving-anchor EAG-V is claimed to keep an O(1/k^2) squared-gradient-norm rate under a strong variance-decay condition; two moving-anchor Popov variants are introduced without a convergence proof.
2863–2873
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
-
Stochastic Moving Anchor Algorithms and a Popov's Scheme with Moving Anchor
Stochastic moving-anchor EAG-V is claimed to keep an O(1/k^2) squared-gradient-norm rate under a strong variance-decay condition; two moving-anchor Popov variants are introduced without a convergence proof.