Anchoring is realized as operator-side Tikhonov regularization before applying the base method, recovering Halpern iteration from Picard and producing new regularized forward-step, EG, and PEG variants with O(1/k) or O(1/sqrt(k)) residual rates under monotone Lipschitz assumptions.
Stochastic moving an- chor algorithms and a Popov’s scheme with moving anchor.arXiv preprint arXiv:2506.07290,
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
-
A Unifying View of Anchoring via Operator-Side Tikhonov Regularization
Anchoring is realized as operator-side Tikhonov regularization before applying the base method, recovering Halpern iteration from Picard and producing new regularized forward-step, EG, and PEG variants with O(1/k) or O(1/sqrt(k)) residual rates under monotone Lipschitz assumptions.