# A Rate of Convergence for Two-Block Coordinate Descent

arXiv: https://arxiv.org/abs/1901.08794 · HTML: https://mlsanity.com/paper/1901.08794/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 25 Jan 2019.

## Built on by (most cited first, 1 of 1)

- [Solving Viewing Graph Optimization for Simultaneous Position and Rotation Registration](https://mlsanity.com/paper/2108.12876/) (2021)

## 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.