A mini-batch stochastic Krasnosel'skiĭ-Mann algorithm converges almost surely to fixed points of nonexpansive mappings when batch sizes increase appropriately.
Uspekhi Matematicheskikh Nauk10, 123–127 (1955)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.OC 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A mini-batch stochastic Halpern algorithm converges in mean square to the closest fixed point when using diminishing step sizes and increasing batch sizes.
citing papers explorer
-
Mini-Batch Stochastic Krasnosel'ski\u\i-Mann Algorithm for Nonexpansive Fixed Point Problems
A mini-batch stochastic Krasnosel'skiĭ-Mann algorithm converges almost surely to fixed points of nonexpansive mappings when batch sizes increase appropriately.
-
Mini-Batch Stochastic Halpern Algorithm for Nonexpansive Fixed point Problems
A mini-batch stochastic Halpern algorithm converges in mean square to the closest fixed point when using diminishing step sizes and increasing batch sizes.