Recognition: unknown
A Rate of Convergence for Two-Block Coordinate Descent
classification
🧮 math.OC
keywords
convergencecoordinatedescentliteraturenon-asymptoticproofratereport
read the original abstract
This short report gives a non-asymptotic rate of convergence proof for solving a two-block coordinate descent problem. This non-asymptotic proof is a simple result that can be derived easily from available results in the literature. We give the results in this report because in this general form we have not seen being stated in the literature.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.