1. Khachiyan, L., Tarasov, S., Erlich, E.: The inscribed ellipsoid method. Sov. Math. Dokl. 37, 226–230 (1988)
2. Luo, Z.Q., Tseng, P.: On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18(2), 846–867 (1993)
3. Nesterov, Yu.: Smooth minimization of non-smooth functions. Math. Program. A 103(1), 127–152 (2005)
4. Nesterov, Yu.: Primal-dual subgradient methods for convex problems. Math. Program. 120(1), 261–283 (2009)
5. Nesterov, Yu.: Efficiency of coordinate descent methods on huge-scale optimization problems. CORE iscussion paper 2010/2. Accepted by SIOPT