Fully implicit resolvent discretization of noisy accelerated gradient dynamics produces a Lyapunov mean-square recursion whose contraction factor improves and stationary error scales as O(1/α), vanishing for large α under accurate inner solves.
Mathematical Programming195(1), 735–781 (2022)
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
-
IRON: Implicit Resolvent Optimization under Noise
Fully implicit resolvent discretization of noisy accelerated gradient dynamics produces a Lyapunov mean-square recursion whose contraction factor improves and stationary error scales as O(1/α), vanishing for large α under accurate inner solves.