Interior-point polynomial algorithms in convex programming Y Nesterov, A Nemirovski | 5921 | 1994 |

Introductory lectures on convex optimization: A basic course Y Nesterov Springer Science & Business Media, 2003 | 5253 | 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 | 4186* | 1983 |

Smooth minimization of non-smooth functions Y Nesterov Mathematical programming 103 (1), 127-152, 2005 | 2538 | 2005 |

Gradient methods for minimizing composite functions Y Nesterov Mathematical Programming 140 (1), 125-161, 2013 | 2044 | 2013 |

Efficiency of coordinate descent methods on huge-scale optimization problems Y Nesterov SIAM Journal on Optimization 22 (2), 341-362, 2012 | 1169 | 2012 |

Primal-dual subgradient methods for convex problems Y Nesterov Mathematical programming 120 (1), 221-259, 2009 | 859 | 2009 |

Self-scaled barriers and interior-point methods for convex programming YE Nesterov, MJ Todd Mathematics of Operations research 22 (1), 1-42, 1997 | 756 | 1997 |

Cubic regularization of Newton method and its global performance Y Nesterov, BT Polyak Mathematical Programming 108 (1), 177-205, 2006 | 685 | 2006 |

Primal-dual interior-point methods for self-scaled cones YE Nesterov, MJ Todd SIAM Journal on optimization 8 (2), 324-364, 1998 | 668 | 1998 |

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 | 550 | 2010 |

New variants of bundle methods C Lemaréchal, A Nemirovskii, Y Nesterov Mathematical programming 69 (1-3), 111-147, 1995 | 531 | 1995 |

Squared functional systems and optimization problems Y Nesterov High performance optimization, 405-440, 2000 | 527 | 2000 |

Semidefinite relaxation and nonconvex quadratic optimization Y Nesterov Optimization methods and software 9 (1-3), 141-160, 1998 | 491 | 1998 |

Random gradient-free minimization of convex functions Y Nesterov, V Spokoiny Foundations of Computational Mathematics 17 (2), 527-566, 2017 | 486 | 2017 |

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 | 460 | 1994 |

First-order methods of smooth convex optimization with inexact oracle O Devolder, F Glineur, Y Nesterov Mathematical Programming 146 (1-2), 37-75, 2014 | 378 | 2014 |

Lectures on convex optimization Y Nesterov Springer, 2018 | 352 | 2018 |

Excessive gap technique in nonsmooth convex minimization Y Nesterov SIAM Journal on Optimization 16 (1), 235-249, 2005 | 287 | 2005 |

Introductory lectures on convex programming volume i: Basic course Y Nesterov Lecture notes 3 (4), 5, 1998 | 280 | 1998 |