In practical applications of iterative first-order optimization, the learning
rate schedule remains notoriously difficult to understand and expensive to
tune. We demonstrate the presence of these subtleties even in the innocuous
case when the objective is a convex quadratic. We reinterpret an iterative
algorithm from the numerical analysis literature as what