I’ve been reading a few algorithm papers recently and they mostly discuss convergence rates, rather than time complexity. In my education so far we’ve always talked about time complexity, because it is interesting to understand how an algorithm scales with dimensionality. For example, in this paper, the convergence rate is given as O(1/t). My questions would be: