NOD extends Nesterov acceleration to strongly monotone operators by Asplund decomposition into cyclically monotone and monotone parts, achieving iteration complexity Θ(√(L_φ/μ + L_S²/μ²) log(1/ε)).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Nesterov Acceleration with Operator Decomposition
NOD extends Nesterov acceleration to strongly monotone operators by Asplund decomposition into cyclically monotone and monotone parts, achieving iteration complexity Θ(√(L_φ/μ + L_S²/μ²) log(1/ε)).