mlsanityData to 7 Oct 2026

A Rate of Convergence for Two-Block Coordinate Descent

arXiv 1901.08794 ↗First posted 25 Jan 2019math.OCcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 25 Jan 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1.

1 paper.