3 problems

Let $N$ denote the iteration count, and consider full fixed-step cyclic coordinate descent on a problem partitioned into $2$ blocks, allowing the update to use all past gradient in…

RPCD worst-case conjecture. The upper bound above, proved for the specified permutation-invariant class of quadratic Hessians, extends to all positive-definite quadratic functions.…

Let $\{\mathbf{A}^k\}$ be the sequence generated by Algorithm, where $\mathbf{A}^k$ is the solution $(\mathbf{A}^{(1)},\mathbf{A}^{(2)},\ldots,\mathbf{A}^{(N)})$ in the $k$-th iter…