Before revision:  For the special case of linear fractional combinatorial optimization, our method converges in O(m\log m) iterations, improving upon the previous best bound of O(m^2\log m) by Wang et al. ( 2006 ).
After revision:  For the special case of linear fractional combinatorial optimization, our method converges in O(m\log m) iterations, improving upon the previous best bound of O(m^2\log m) by Wang et al. ( 2017 ).