Introduces a unified abstract framework for randomized subspace correction methods with convergence analysis for convex optimization under general assumptions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Randomized subspace correction methods for convex optimization
Introduces a unified abstract framework for randomized subspace correction methods with convergence analysis for convex optimization under general assumptions.