!!Yurii Nesterov - Selected Publications
\\
Yu. Nesterov. Lectures on Convex Optimization. Springer, 2018.\\
\\
Yu. Nesterov. Introductory Lectures on Convex Optimization. Kluwer, Boston, 2004.\\
\\
Yu. Nesterov, A. Nemirovskii. Interior point polynomial methods in convex programming. Theory and Applications SIAM, Philadelphia, 1994.-\\
\\
Yu. Nesterov, A. Nemirovskii.  Self-concordant functions and polynomial time methods in Convex Programming. Central Economic & Mathematical Institute (CEMI) of the USSR Acad. Sci., Moscow 1989. (in English).\\
\\
Yu. Nesterov. Implementable tensor methods in Convex Optimization. Mathematical Programming. DOI 10.1007/s10107-019-01449-1 (2019).\\
\\
G. Grapiglia, Yu. Nesterov. Accelerated regularized Newton method for minimizing composite convex functions. SIOPT, 29(1), 77-99 (2019).\\
\\
A.Gasnikov, E. Gasnikova, and Yu. Nesterov. Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks. Computational Mathematics and Mathematical Physics, 58(9), 1395 - 1403 (2018).\\
\\
Yu. Nesterov. Complexity bounds of primal-dual methods based on the model of objective function. Mathematical Programming, 171(12), 311330 (2018).\\
\\
Yu. Nesterov. Efficiency of coordinate-descent methods on huge scale optimization problems. SIOPT, 22(2), 341-362 (2012).\\
\\
M. Baes, A. Del Pia, Yu. Nesterov, Sh. Onn, and R.Weismantel. Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Mathematical Programming, Vol. Ser. B, no.134, p. 305-322 (2012), DOI 10.1007/s10107-012-0545-8.