Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem. - Yurii E. Nesterov; Arkadii Nemirovskii (SIAM J. Optim., 1991)

Interior-point polynomial algorithms in convex programming. - Yurii E. Nesterov; Arkadii Nemirovskii (SIAM, 1994)

New variants of bundle methods. - Claude Lemaréchal; Arkadii Nemirovskii; Yurii E. Nesterov (Math. Program., 1995)

Complexity estimates of some cutting plane methods based on the analytic barrier. - Yurii E. Nesterov (Math. Program., 1995)

An interior-point method for generalized linear-fractional programming. - Yurii E. Nesterov; A. S. Nemirovskii 001 (Math. Program., 1995)

Long-step strategies in interior-point primal-dual methods. - Yurii E. Nesterov (Math. Program., 1996)

Self-Scaled Barriers and Interior-Point Methods for Convex Programming. - Yurii E. Nesterov; Michael J. Todd (Math. Oper. Res., 1997)

Interior-point methods: An old and new approach to nonlinear programming. - Yurii E. Nesterov (Math. Program., 1997)

Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods. - Yurii E. Nesterov; Arkadi Nemirovski (Math. Oper. Res., 1998)

Primal-Dual Interior-Point Methods for Self-Scaled Cones. - Yurii E. Nesterov; Michael J. Todd (SIAM J. Optim., 1998)

Positive transfer functions and convex optimization. - Yves V. Genin; Yurii E. Nesterov; Paul Van Dooren (ECC, 1999)

The analytic center of LMI's and Riccati equations. - Yves V. Genin; Yurii E. Nesterov; Paul Van Dooren (ECC, 1999)

Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. - Yurii E. Nesterov; Michael J. Todd; Yinyu Ye 001 (Math. Program., 1999)

Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities. - Yurii E. Nesterov; Jean-Philippe Vial (SIAM J. Optim., 1999)

Positivity and Linear Matrix Inequalities. - Yvan Hachez; Yurii E. Nesterov; Radu Stefan (Eur. J. Control, 2002)

On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods. - Yurii E. Nesterov; Michael J. Todd (Found. Comput. Math., 2002)

Optimization Problems over Positive Pseudopolynomial Matrices. - Yves V. Genin; Yvan Hachez; Yurii E. Nesterov; Paul Van Dooren (SIAM J. Matrix Anal. Appl., 2003)

Introductory Lectures on Convex Optimization - A Basic Course - Yurii E. Nesterov (Springer, 2004)

Approximations of the Rate of Growth of Switched Linear Systems. - Vincent D. Blondel; Yurii E. Nesterov; Jacques Theys (HSCC, 2004)

Augmented self-concordant barriers and nonlinear optimization problems with finite complexity. - Yurii E. Nesterov; Jean-Philippe Vial (Math. Program., 2004)

Smooth minimization of non-smooth functions. - Yurii E. Nesterov (Math. Program., 2005)

Lexicographic differentiation of nonsmooth functions. - Yurii E. Nesterov (Math. Program., 2005)

Excessive Gap Technique in Nonsmooth Convex Minimization. - Yurii E. Nesterov (SIAM J. Optim., 2005)

Computationally Efficient Approximations of the Joint Spectral Radius. - Vincent D. Blondel; Yurii E. Nesterov (SIAM J. Matrix Anal. Appl., 2005)

Cubic regularization of Newton method and its global performance. - Yurii E. Nesterov; Boris T. Polyak (Math. Program., 2006)

Dual extrapolation and its applications to solving variational inequalities and related problems. - Yurii E. Nesterov (Math. Program., 2007)

Smoothing Technique and its Applications in Semidefinite Optimization. - Yurii E. Nesterov (Math. Program., 2007)

Modified Gauss-Newton scheme with worst case guarantees for global performance. - Yurii E. Nesterov (Optim. Methods Softw., 2007)

Confidence level solutions for stochastic programming. - Yurii E. Nesterov; Jean-Philippe Vial (Autom., 2008)

Parabolic target space and primal-dual interior-point methods. - Yurii E. Nesterov (Discret. Appl. Math., 2008)

Primal Central Paths and Riemannian Distances for Convex Sets. - Yurii E. Nesterov; Arkadi Nemirovski (Found. Comput. Math., 2008)

Accelerating the cubic regularization of Newton's method on convex problems. - Yurii E. Nesterov (Math. Program., 2008)

Rounding of convex sets and efficient gradient methods for linear programming problems. - Yurii E. Nesterov (Optim. Methods Softw., 2008)

Optimizing the Coupling Between Two Isometric Projections of Matrices. - Catherine Fraikin; Yurii E. Nesterov; Paul Van Dooren (SIAM J. Matrix Anal. Appl., 2008)

Unconstrained Convex Minimization in Relative Scale. - Yurii E. Nesterov (Math. Oper. Res., 2009)

Foreword: special issue on nonsmooth optimization and applications. - Boris S. Mordukhovich; Arkadi Nemirovski; Yurii E. Nesterov (Math. Program., 2009)

Primal-dual subgradient methods for convex problems. - Yurii E. Nesterov (Math. Program., 2009)

Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices. - Vincent D. Blondel; Yurii E. Nesterov (SIAM J. Matrix Anal. Appl., 2009)

Exponential Ranking: Taking into Account Negative Links. - Vincent A. Traag; Yurii E. Nesterov; Paul Van Dooren (SocInfo, 2010)

Generalized Power Method for Sparse Principal Component Analysis. - Michel Journée; Yurii E. Nesterov; Peter Richtárik; Rodolphe Sepulchre (J. Mach. Learn. Res., 2010)

Indirect reciprocity through gossiping can lead to cooperative clusters. - Vincent A. Traag; Paul Van Dooren; Yurii E. Nesterov (ALIFE, 2011)

Narrow scope for resolution-free community detection - Vincent A. Traag; Paul Van Dooren; Yurii E. Nesterov (CoRR, 2011)

Barrier subgradient method. - Yurii E. Nesterov (Math. Program., 2011)

Design and Operations of Gas Transmission Networks. - Frédéric Babonneau; Yurii E. Nesterov; Jean-Philippe Vial (Oper. Res., 2012)

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. - Michel Baes; Alberto Del Pia; Yurii E. Nesterov; Shmuel Onn; Robert Weismantel (Math. Program., 2012)

Towards non-symmetric conic optimization. - Yurii E. Nesterov (Optim. Methods Softw., 2012)

Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization. - Olivier Devolder; François Glineur; Yurii E. Nesterov (SIAM J. Optim., 2012)

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems. - Yurii E. Nesterov (SIAM J. Optim., 2012)

On first-order algorithms for l1/nuclear norm minimization. - Yurii E. Nesterov; Arkadi Nemirovski (Acta Numer., 2013)

Nearest stable system using successive convex approximations. - Francois-Xavier Orbandexivry; Yurii E. Nesterov; Paul Van Dooren (Autom., 2013)

Gradient methods for minimizing composite functions. - Yurii E. Nesterov (Math. Program., 2013)

Hessian distances and their applications in the complexity analysis of interior-point methods. - Yurii E. Nesterov; Yu Xia (Optim. Methods Softw., 2013)

Optimizing the Spectral Radius. - Yurii E. Nesterov; Vladimir Protasov (SIAM J. Matrix Anal. Appl., 2013)

First-order methods of smooth convex optimization with inexact oracle. - Olivier Devolder; François Glineur; Yurii E. Nesterov (Math. Program., 2014)

Subgradient methods for huge-scale optimization problems. - Yurii E. Nesterov (Math. Program., 2014)

Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems. - Yurii E. Nesterov; S. Shpirko (SIAM J. Optim., 2014)

Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction. - Yurii E. Nesterov; Vladimir Shikhman (SAGT, 2015)

Finding the stationary states of Markov chains by iterative methods. - Yurii E. Nesterov; Arkadi Nemirovski (Appl. Math. Comput., 2015)

Primal-Dual Methods for Solving Infinite-Dimensional Games. - Pavel E. Dvurechensky; Yurii E. Nesterov; Vladimir G. Spokoiny (J. Optim. Theory Appl., 2015)

Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization. - Yurii E. Nesterov; Vladimir Shikhman (J. Optim. Theory Appl., 2015)

Universal gradient methods for convex optimization problems. - Yurii E. Nesterov (Math. Program., 2015)

Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods. - Lev Bogolubsky; Pavel E. Dvurechensky; Alexander V. Gasnikov; Gleb Gusev; Yurii E. Nesterov; Andrei M. Raigorodskii; Aleksey Tikhonov; Maksim Zhukovskii (NIPS, 2016)

A Subgradient Method for Free Material Design. - Michal Kocvara; Yurii E. Nesterov; Yu Xia (SIAM J. Optim., 2016)

Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems. - Yurii E. Nesterov; Levent Tunçel (SIAM J. Optim., 2016)

Random Gradient-Free Minimization of Convex Functions. - Yurii E. Nesterov; Vladimir G. Spokoiny (Found. Comput. Math., 2017)

Preface to the Special Issue "Optimization, Control and Applications" in Honor of Boris T. Polyak's 80th Birthday. - Boris S. Mordukhovich; Yurii E. Nesterov (J. Optim. Theory Appl., 2017)

Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks. - Ion Necoara; Yurii E. Nesterov; François Glineur (J. Optim. Theory Appl., 2017)

Distributed Price Adjustment Based on Convex Analysis. - Yurii E. Nesterov; Vladimir Shikhman (J. Optim. Theory Appl., 2017)

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians. - Geovani Nunes Grapiglia; Yurii E. Nesterov (SIAM J. Optim., 2017)

Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems. - Yurii E. Nesterov; Sebastian U. Stich (SIAM J. Optim., 2017)

Increasing Training Stability for Deep CNNS. - Pierre Gillot; Jenny Benois-Pineau; Akka Zemmari; Yurii E. Nesterov (ICIP, 2018)

Dual subgradient method with averaging for optimal resource allocation. - Yurii E. Nesterov; Vladimir Shikhman (Eur. J. Oper. Res., 2018)

Complexity bounds for primal-dual methods minimizing the model of objective function. - Yurii E. Nesterov (Math. Program., 2018)

Relatively Smooth Convex Optimization by First-Order Methods, and Applications. - Haihao Lu; Robert M. Freund; Yurii E. Nesterov (SIAM J. Optim., 2018)

Linear convergence of first order methods for non-strongly convex optimization. - Ion Necoara; Yurii E. Nesterov; François Glineur (Math. Program., 2019)

Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions. - Geovani Nunes Grapiglia; Yurii E. Nesterov (SIAM J. Optim., 2019)

Inexact Tensor Methods with Dynamic Accuracies. - Nikita Doikov; Yurii E. Nesterov (ICML, 2020)

Stochastic Subspace Cubic Newton Method. - Filip Hanzely; Nikita Doikov; Yurii E. Nesterov; Peter Richtárik (ICML, 2020)

Convex optimization based on global lower second-order models. - Nikita Doikov; Yurii E. Nesterov (NeurIPS, 2020)

On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient. - Guillaume O. Berger; Pierre-Antoine Absil; Raphaël M. Jungers; Yurii E. Nesterov (J. Optim. Theory Appl., 2020)

Smoothness Parameter of Power of Euclidean Norm. - Anton Rodomanov; Yurii E. Nesterov (J. Optim. Theory Appl., 2020)

Contracting Proximal Methods for Smooth Convex Optimization. - Nikita Doikov; Yurii E. Nesterov (SIAM J. Optim., 2020)

Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives. - Geovani Nunes Grapiglia; Yurii E. Nesterov (SIAM J. Optim., 2020)

Computing Closest Stable Nonnegative Matrix. - Yurii E. Nesterov; Vladimir Yu. Protasov (SIAM J. Matrix Anal. Appl., 2020)

Soft clustering by convex electoral model. - Yurii E. Nesterov (Soft Comput., 2020)

Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method. - Nikita Doikov; Yurii E. Nesterov (J. Optim. Theory Appl., 2021)

Superfast Second-Order Methods for Unconstrained Convex Optimization. - Yurii E. Nesterov (J. Optim. Theory Appl., 2021)

New Results on Superlinear Convergence of Classical Quasi-Newton Methods. - Anton Rodomanov; Yurii E. Nesterov (J. Optim. Theory Appl., 2021)

Implementable tensor methods in unconstrained convex optimization. - Yurii E. Nesterov (Math. Program., 2021)

On inexact solution of auxiliary problems in tensor methods for convex optimization. - Geovani Nunes Grapiglia; Yurii E. Nesterov (Optim. Methods Softw., 2021)

Primal-dual accelerated gradient methods with small-dimensional relaxation oracle. - Yurii E. Nesterov; Alexander V. Gasnikov; Sergey Guminov; Pavel E. Dvurechensky (Optim. Methods Softw., 2021)

Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure. - Yurii E. Nesterov (SIAM J. Optim., 2021)

Greedy Quasi-Newton Methods with Explicit Superlinear Convergence. - Anton Rodomanov; Yurii E. Nesterov (SIAM J. Optim., 2021)

Discrete Choice Prox-Functions on the Simplex. - David Müller 007; Yurii E. Nesterov; Vladimir Shikhman (Math. Oper. Res., 2022)

Local convergence of tensor methods. - Nikita Doikov; Yurii E. Nesterov (Math. Program., 2022)

Rates of superlinear convergence for classical quasi-Newton methods. - Anton Rodomanov; Yurii E. Nesterov (Math. Program., 2022)

Efficient numerical methods to solve sparse linear equations with application to PageRank. - Anton Anikin 002; Alexander V. Gasnikov; Alexander Gornov; Dmitry Kamzolov; Yury Maximov; Yurii E. Nesterov (Optim. Methods Softw., 2022)

Tensor methods for finding approximate stationary points of convex functions. - Geovani Nunes Grapiglia; Yurii E. Nesterov (Optim. Methods Softw., 2022)

Inexact basic tensor methods for some classes of convex optimization problems. - Yurii E. Nesterov (Optim. Methods Softw., 2022)

Gradient methods with memory. - Yurii E. Nesterov; Mihai I. Florea (Optim. Methods Softw., 2022)

High-Order Optimization Methods for Fully Composite Problems. - Nikita Doikov; Yurii E. Nesterov (SIAM J. Optim., 2022)

Inexact accelerated high-order proximal-point methods. - Yurii E. Nesterov (Math. Program., 2023)

Affine-invariant contracting-point methods for Convex Optimization. - Nikita Doikov; Yurii E. Nesterov (Math. Program., 2023)

Subgradient ellipsoid method for nonsmooth convex problems. - Anton Rodomanov; Yurii E. Nesterov (Math. Program., 2023)

Conic optimization-based algorithms for nonnegative matrix factorization. - Valentin Leplat; Yurii E. Nesterov; Nicolas Gillis; François Glineur (Optim. Methods Softw., 2023)

Adaptive Third-Order Methods for Composite Convex Optimization. - Geovani Nunes Grapiglia; Yurii E. Nesterov (SIAM J. Optim., 2023)

Preface for the special edition of optimization methods and software. - Serge Gratton; Philippe L. Toint; Jacek Gondzio; Yurii E. Nesterov; Yaxiang Yuan (Optim. Methods Softw., 2024)

Gradient regularization of Newton method with Bregman distances. - Nikita Doikov; Yurii E. Nesterov (Math. Program., 2024)

Super-Universal Regularized Newton Method. - Nikita Doikov; Konstantin Mishchenko; Yurii E. Nesterov (SIAM J. Optim., 2024)

Set-Limited Functions and Polynomial-Time Interior-Point Methods. - Yurii E. Nesterov (J. Optim. Theory Appl., 2024)

High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. - Masoud Ahookhosh; Yurii E. Nesterov (Math. Program., 2024)

Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods. - Masoud Ahookhosh; Yurii E. Nesterov (Math. Program., 2024)

Primal Subgradient Methods with Predefined Step Sizes. - Yurii E. Nesterov (J. Optim. Theory Appl., 2024)

Convex Quartic Problems: Homogenized Gradient Method and Preconditioning. - Radu-Alexandru Dragomir; Yurii E. Nesterov (SIAM J. Optim., 2025)