  Short-step methods are an important class of algorithms for solving convex
constrained optimization problems. In this short paper, we show that under very
mild assumptions on the self-concordant barrier and the width of the
$\ell_2$-neighbourhood, any short-step interior-point method is not strongly
polynomial-time.
