| Interior-point polynomial algorithms in convex programming Y Nesterov, A Nemirovski | 6453 | 1994 |
| Introductory lectures on convex optimization: A basic course Y Nesterov Springer Science & Business Media, 2003 | 6162 | 2003 |
| A method for solving the convex programming problem with convergence rate O (1/k^ 2) YE Nesterov Dokl. akad. nauk Sssr 269, 543-547, 1983 | 5364* | 1983 |
| Smooth minimization of non-smooth functions Y Nesterov Mathematical programming 103 (1), 127-152, 2005 | 2805 | 2005 |
| Gradient methods for minimizing composite functions Y Nesterov Mathematical programming 140 (1), 125-161, 2013 | 2299 | 2013 |
| Efficiency of coordinate descent methods on huge-scale optimization problems Y Nesterov SIAM Journal on Optimization 22 (2), 341-362, 2012 | 1326 | 2012 |
| Primal-dual subgradient methods for convex problems Y Nesterov Mathematical programming 120 (1), 221-259, 2009 | 984 | 2009 |
| Cubic regularization of Newton method and its global performance Y Nesterov, BT Polyak Mathematical Programming 108 (1), 177-205, 2006 | 810 | 2006 |
| Self-scaled barriers and interior-point methods for convex programming YE Nesterov, MJ Todd Mathematics of Operations research 22 (1), 1-42, 1997 | 784 | 1997 |
| Lectures on convex optimization Y Nesterov Springer International Publishing, 2018 | 722 | 2018 |
| Primal-dual interior-point methods for self-scaled cones YE Nesterov, MJ Todd SIAM Journal on optimization 8 (2), 324-364, 1998 | 703 | 1998 |
| Random gradient-free minimization of convex functions Y Nesterov, V Spokoiny Foundations of Computational Mathematics 17 (2), 527-566, 2017 | 681 | 2017 |
| Generalized power method for sparse principal component analysis. M Journée, Y Nesterov, P Richtárik, R Sepulchre Journal of Machine Learning Research 11 (2), 2010 | 615 | 2010 |
| New variants of bundle methods C Lemaréchal, A Nemirovskii, Y Nesterov Mathematical programming 69 (1), 111-147, 1995 | 569 | 1995 |
| Squared functional systems and optimization problems Y Nesterov High performance optimization, 405-440, 2000 | 562 | 2000 |
| Semidefinite relaxation and nonconvex quadratic optimization Y Nesterov Optimization methods and software 9 (1-3), 141-160, 1998 | 525 | 1998 |
| First-order methods of smooth convex optimization with inexact oracle O Devolder, F Glineur, Y Nesterov Mathematical Programming 146 (1), 37-75, 2014 | 481 | 2014 |
| Interior-point polynomial algorithms in convex programming, volume 13 of SIAM Studies in Applied Mathematics Y Nesterov, A Nemirovskii Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA 26, 1994 | 404 | 1994 |
| Introductory lectures on convex programming Y Nesterov | 337 | 1998 |
| Excessive gap technique in nonsmooth convex minimization Y Nesterov SIAM Journal on Optimization 16 (1), 235-249, 2005 | 306 | 2005 |
Arkadi NemirovskiProfessor and Jh. Hunter Academic Chair, School of Industrial and Systems Engineering, GeorgiaVerified email at isye.gatech.edu
