Two linearized block coordinate descent algorithms for nonsmooth composite optimization converge in expectation to a stationary point at O(1/ε²) rate.
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
CONDITIONAL 1representative citing papers
citing papers explorer
-
Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
Two linearized block coordinate descent algorithms for nonsmooth composite optimization converge in expectation to a stationary point at O(1/ε²) rate.