Y. Nesterov

发表

A method for solving the convex programming problem with convergence rate O(1/k^2)

Y. Nesterov, 1983 .

A method for unconstrained convex minimization problem with the rate of convergence o(1/k^2)

Y. Nesterov, 1983 .

Gradient methods for minimizing composite objective function

Y. Nesterov, 2007 .

Semidefinite relaxation and nonconvex quadratic optimization

Y. Nesterov, 1998 .

Primal-dual subgradient methods for minimizing uniformly convex functions

Y. Nesterov, A. Iouditski, 2010, 1401.1792.

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems

Yurii Nesterov, Y. Nesterov, 2012, SIAM J. Optim..

Local quadratic convergence of polynomial-time interior-point methods for conic optimization problems

Y. Nesterov, L. Tunçel, 2009 .

Semidefinite programming relaxations of nonconvex quadratic optimization

Y. Ye, Y. Nesterov, H. Wolkowicz, 2000 .

Smooth minimization of non-smooth functions

Yurii Nesterov, Y. Nesterov, 2005, Math. Program..

Primal-dual subgradient methods for convex problems

Yurii Nesterov, Y. Nesterov, 2005, Math. Program..

Dual Extrapolation and its Applications for Solving Variational Inequalities and Related Problems'

Y. Nesterov, 2003 .

Linear convergence of first order methods for non-strongly convex optimization

Yurii Nesterov, Ion Necoara, François Glineur, 2015, Math. Program..

Quality of semidefinite relaxation for nonconvex quadratic optimization

Y. Nesterov, 1997 .

Cubic regularization of Newton method and its global performance

Yurii Nesterov, Boris T. Polyak, Boris Polyak, 2006, Math. Program..

A RANDOM COORDINATE DESCENT METHOD ON LARGE-SCALE OPTIMIZATION PROBLEMS WITH LINEAR CONSTRAINTS

Y. Nesterov, I. Necoara, F. Glineur, 2013 .

Optimal methods of smooth convex minimization

A. Nemirovskii, Y. Nesterov, 1986 .

Gradient methods for minimizing composite functions

Yurii Nesterov, Y. Nesterov, 2012, Mathematical Programming.

Rounding of Convex Sets and Efficient Gradient Methods for Linear Programming Problems

Y. Nesterov, 2004 .

First-order methods with inexact oracle: the strongly convex case

Y. Nesterov, O. Devolder, F. Glineur, 2013 .

On first-order algorithms for l1/nuclear norm minimization

Yurii Nesterov, Arkadi Nemirovski, Y. Nesterov, 2013, Acta Numerica.

Conic formulation of a convex programming problem and duality

A. S. Nemirovsky, Y. Nesterov, 1992 .

Introductory Lectures on Convex Optimization - A Basic Course

Yurii Nesterov, Y. Nesterov, 2014, Applied Optimization.

Lectures on Convex Optimization

Yurii Nesterov, Y. Nesterov, 2018 .

Primal-Dual Subgradient Methods for Convex Problems

Y. Nesterov, 2005 .

Interior-point polynomial algorithms in convex programming

Yurii Nesterov, Arkadi Nemirovski, Y. Nesterov, 1994, Siam studies in applied mathematics.

Structure of non-negative polynomials and optimization problems

Y. Nesterov, 1997 .

Global quadratic optimization via conic relaxation

Y. Nesterov, 1998 .

Infeasible Start Interior-Point Primal-Dual Methods in Nonlinear Programming

Y. Nesterov, 1995 .

Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming

Y. Nesterov, M. Todd, 1994 .

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

Michael J. Todd, Yurii Nesterov, Y. Nesterov, 1997, Math. Oper. Res..

Primal-Dual Interior-Point Methods for Self-Scaled Cones

Michael J. Todd, Yurii Nesterov, Y. Nesterov, 1998, SIAM J. Optim..

Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems

Yurii Nesterov, Sebastian U. Stich, Y. Nesterov, 2017, SIAM J. Optim..

Efficient numerical methods for entropy-linear programming problems

Y. Nesterov, A. Gasnikov, A. Chernov, 2016 .

Accelerating the cubic regularization of Newton’s method on convex problems

Yurii Nesterov, Y. Nesterov, 2005, Math. Program..

First-order methods of smooth convex optimization with inexact oracle

Yurii Nesterov, François Glineur, Olivier Devolder, 2013, Mathematical Programming.

Double smoothing technique for infinite-dimensional optimization problems with applications to optimal control

Y. Nesterov, O. Devolder, F. Glineur, 2010 .

Implementable tensor methods in unconstrained convex optimization

Yurii Nesterov, Y. Nesterov, 2019, Mathematical Programming.

Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization

A. Juditsky, Y. Nesterov, 2014 .

Modified Gauss-Newton Scheme with Worst-Case Guarantees for its Global Performance

Y. Nesterov, 2003 .

New variants of bundle methods

Yurii Nesterov, Claude Lemaréchal, Arkadi Nemirovski, 1995, Math. Program..

Smoothing Technique and its Applications in Semidefinite Optimization

Yurii Nesterov, Y. Nesterov, 2004, Math. Program..

Approximations of the Rate of Growth of Switched Linear Systems

Vincent D. Blondel, Yurii Nesterov, Jacques Theys, 2004, HSCC.

On the accuracy of the ellipsoid norm approximation of the joint spectral radius

Y. Nesterov, V. Blondel, J. Theys, 2005 .

Smoothness Parameter of Power of Euclidean Norm

Anton Rodomanov, Yurii Nesterov, Y. Nesterov, 2019, Journal of Optimization Theory and Applications.

Tensor Methods for Minimizing Functions with H\"{o}lder Continuous Higher-Order Derivatives

Y. Nesterov, G. N. Grapiglia, 2019 .

Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method

Yurii Nesterov, Nikita Doikov, Y. Nesterov, 2019, Journal of Optimization Theory and Applications.

Subgradient methods for huge-scale optimization problems

Yurii Nesterov, Y. Nesterov, 2014, Math. Program..

Random walk in a simplex and quadratic optimization over convex polytopes

Y. Nesterov, 2003 .

Generalized Power Method for Sparse Principal Component Analysis

Yurii Nesterov, Peter Richtárik, Rodolphe Sepulchre, 2008, J. Mach. Learn. Res..

A gradient-type algorithm optimizing the coupling between matrices

Y. Nesterov, P. Dooren, C. Fraikin, 2008 .

The analytic center of LMI's and Riccati equations

Y. Nesterov, Y. Genin, P. Dooren, 1999, 1999 European Control Conference (ECC).

Nonsymmetric Potential-Reduction Methods for General Cones

Y. Nesterov, 2006 .

Towards Nonsymmetric Conic Optimization

Y. Nesterov, 2006 .

Globally Convergent Second-order Schemes for Minimizing Twice-differentiable Functions

Y. Nesterov, G. N. Grapiglia, 2016 .

Squared Functional Systems and Optimization Problems

Yurii Nesterov, Y. Nesterov, 2000 .

Lexicographic differentiation of nonsmooth functions

Yurii Nesterov, Y. Nesterov, 2005, Math. Program..

Dual extrapolation and its applications to solving variational inequalities and related problems

Yurii Nesterov, Y. Nesterov, 2007, Math. Program..

Random Gradient-Free Minimization of Convex Functions

Yurii Nesterov, Vladimir G. Spokoiny, Y. Nesterov, 2015, Foundations of Computational Mathematics.

Intermediate gradient methods for smooth convex problems with inexact oracle

Y. Nesterov, O. Devolder, F. Glineur, 2013 .

Universal gradient methods for convex optimization problems

Yurii Nesterov, Y. Nesterov, 2015, Math. Program..

Stochastic Subspace Cubic Newton Method pdf

Yurii Nesterov, Filip Hanzely, Peter Richt'arik, 2020, ICML.

Characteristic functions of directed graphs and applications to stochastic equilibrium problems

Y. Nesterov, 2007 .

Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods

Gleb Gusev, Yurii Nesterov, Maksim Zhukovskii, 2016, NIPS.

Constructing Self-Concordant Barriers for Convex Cones

Y. Nesterov, 2006 .

Excessive Gap Technique in Nonsmooth Convex Minimization

Yurii Nesterov, Y. Nesterov, 2005, SIAM J. Optim..

On the efficiency of a randomized mirror descent algorithm in online optimization problems

Y. Nesterov, A. Gasnikov, V. Spokoiny, 2015, Computational Mathematics and Mathematical Physics.

Fast and Precise Approximations of the Joint Spectral Radius

Y. Nesterov, V. Blondel, 2003 .

Recent Advances in Structural Optimization

Y. Nesterov, 2011 .

How to advance in Structural Convex

Y. Nesterov, 2008 .

Inexact basic tensor methods for some classes of convex optimization problems

Y. Nesterov, 2020 .

Convex optimization based on global lower second-order models

Y. Nesterov, N. Doikov, 2020, NeurIPS.

Tensor methods for finding approximate stationary points of convex functions

Y. Nesterov, G. N. Grapiglia, 2019, Optim. Methods Softw..

Dual Methods for Finding Equilibriums in Mixed Models of Flow Distribution in Large Transportation Networks

Y. Nesterov, A. Gasnikov, E. Gasnikova, 2018, Computational Mathematics and Mathematical Physics.

Accelerated Primal-Dual Gradient Descent with Linesearch for Convex, Nonconvex, and Nonsmooth Optimization Problems

Y. Nesterov, S. Guminov, P. Dvurechensky, 2019, Doklady Mathematics.

Computation of the Analytic Center of the Solution Set of the Linear Matrix Inequality Arising in Continuous- and Discrete-Time Passivity Analysis

Y. Nesterov, V. Mehrmann, P. Van Dooren, 2020, Vietnam journal of mathematics.

Solving Infinite-dimensional Optimization Problems by Polynomial Approximation

Yurii Nesterov, Olivier Devolder, FranÃ§ois Glineur, 2010 .

Some first order algorithms for ` 1 / nuclear norm minimization

Y. Nesterov, A. Nemirovski, 2013 .

Universal Method for Stochastic Composite Optimization Problems

A. V. Gasnikov, Y. Nesterov, A. Gasnikov, 2018 .

Contracting Proximal Methods for Smooth Convex Optimization

Yurii Nesterov, Nikita Doikov, Y. Nesterov, 2019, SIAM J. Optim..

Positive transfer functions and convex optimization

Paul Van Dooren, Yurii Nesterov, Yves V. Genin, 1999, 1999 European Control Conference (ECC).

A DOUBLE SMOOTHING TECHNIQUE FOR CONSTRAINED CONVEX OPTIMIZATION PROBLEMS AND APPLICATIONS TO OPTIMAL CONTROL

Y. Nesterov, O. Devolder, F. Glineur, 2011 .

Convergent subgradient methods for nonsmooth convex minimization

Vladimir Shikhman, Y. Nesterov, V. Shikhman, 2014 .

Solving Strongly Monotone Variational and Quasi-Variational Inequalities

Yurii Nesterov, Laura Scrimali, Y. Nesterov, 2006 .

Computation of the Analytic Center of the Solution Set of the Linear Matrix Inequality Arising in Continuous- and Discrete-Time Passivity Analysis

Y. Nesterov, V. Mehrmann, P. Dooren, 2019, Vietnam Journal of Mathematics.

Primal-dual accelerated gradient descent with line search for convex and nonconvex optimization problems

A. V. Gasnikov, P. E. Dvurechensky, Y. Nesterov, 2019, Доклады Академии наук.

Performance of Trigonometric Generating Functions on Some Combinatorial Problems

Y. Nesterov, 2005 .

Optimization Problems over Non-negative Polynomials with Interpolation Constraints

Y. Nesterov, Y. Hachez, 2003 .

Polynomial-time dual algorithms in linear programming

Y. Nesterov, Yu. E. Nesterov, 1989 .

Rates of superlinear convergence for classical quasi-Newton methods

Y. Nesterov, Anton Rodomanov, 2020, 2003.09174.

Rates of superlinear convergence for classical quasi-Newton methods

Y. Nesterov, Anton Rodomanov, 2020, 2003.09174.

Greedy Quasi-Newton Methods with Explicit Superlinear Convergence

Y. Nesterov, Anton Rodomanov, 2020, SIAM J. Optim..

Computation of Fisher–Gale Equilibrium by Auction

Y. Nesterov, V. Shikhman, 2015, Journal of the Operations Research Society of China.

Preface to the Special Issue “Optimization, Control and Applications” in Honor of Boris T. Polyak’s 80th Birthday

Boris S. Mordukhovich, Yurii Nesterov, Y. Nesterov, 2017, J. Optim. Theory Appl..

Local convergence of tensor methods

Y. Nesterov, N. Doikov, 2019, Math. Program..

Special Issue: The 3rd International Conference on Optimization Methods and Software (May 13-17, 2012, Chania, Greece) Foreword

Andreas Griewank, Stefan Ulbrich, Masao Fukushima, 2014 .

Sparsity entropy linear programming

Alexander Gasnikov, Evgenia Gasnikova, Yurii Nesterov, 2014 .

Lecture 5: Algorithmic models of human behavior

Yurii Nesterov, Y. Nesterov, 2012 .

Dynamic pricing under nested logit demand

Yurii Nesterov, Vladimir Shikhman, David Muller, 2021, 2101.04486.

Simple bounds for Boolean quadratic problems

Yurii Nesterov, Y. Nesterov, 2009 .

3. Path-Following Interior-Point Methods

Yurii Nesterov, Arkadii Nemirovskii, A. Nemirovskii, 1994 .

Advances in nonlinear convex optimization

Yurii Nesterov, Y. Nesterov, 1997 .

Algorithmic Principle of Least Revenue for Finding Market Equilibria

Y. Nesterov, V. Shikhman, 2016 .

DP Soft clustering by convex electoral model

Y. Nesterov, 2018 .

Local convergence of tensor methods

Y. Nesterov, N. Doikov, 2019, Math. Program..

Linear convergence of first order methods for non-strongly convex optimization

Y. Nesterov, I. Necoara, F. Glineur, 2015, Math. Program..

Computationally Efficient Approximations of the Joint Spectral Radius

Y. Nesterov, V. Blondel, 2004, SIAM J. Matrix Anal. Appl..

Efficient randomized mirror descents in stochastic online convex optimization

Y. Nesterov, A. Gasnikov, V. Spokoiny, 2014, 1410.3118.

Deterministic and Stochastic Primal-Dual Subgradient Algorithms for Uniformly Convex Minimization

A. Juditsky, Y. Nesterov, 2014 .

Super-Universal Regularized Newton Method

Y. Nesterov, Konstantin Mishchenko, N. Doikov, 2022, SIAM Journal on Optimization.

High-Order Optimization Methods for Fully Composite Problems

Y. Nesterov, N. Doikov, 2022, SIAM Journal on Optimization.

Primal-dual accelerated gradient descent with line search for convex and nonconvex optimization problems

Y. Nesterov, S. Guminov, P. Dvurechensky, 2019, Доклады Академии наук.

Algorithm of Price Adjustment for Market Equilibrium

Y. Nesterov, V. Shikhman, 2015 .

Power method tÃ¢tonnements for Cobb-Douglas economies

Y. Nesterov, V. Ginsburgh, V. Shikhman, 2017 .

Complexity bounds for primal-dual methods minimizing the model of objective function

Y. Nesterov, 2017, Mathematical Programming.

On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient

Guillaume O. Berger, Y. Nesterov, P. Absil, 2020, Journal of Optimization Theory and Applications.

Entropy linear programming

Y. Nesterov, A. Gasnikov, A. Chernov, 2014, 1410.7719.

Convex optimisation over positive polynomials

Paul Van Dooren, Yurii Nesterov, Yves Genin, 2000 .

Random Gradient-Free Minimization of Convex Functions

Y. Nesterov, V. Spokoiny, 2015, Foundations of Computational Mathematics.

On the efficiency of a randomized mirror descent algorithm in online optimization problems

Y. Nesterov, A. Gasnikov, V. Spokoiny, 2015, Computational Mathematics and Mathematical Physics.

Accelerated Primal-Dual Gradient Descent with Linesearch for Convex, Nonconvex, and Nonsmooth Optimization Problems

Y. Nesterov, S. Guminov, P. Dvurechensky, 2019, Doklady Mathematics.

Universal fast gradient method for stochastic composit optimization problems

Y. Nesterov, A. Gasnikov, 2016, 1604.05275.

Gradient methods for minimizing composite functions

Y. Nesterov, 2013, Math. Program..

First-order methods of smooth convex optimization with inexact oracle

Y. Nesterov, F. Glineur, Olivier Devolder, 2013, Mathematical Programming.

On the three-stage version of stable dynamic model

Y. Nesterov, A. Gasnikov, Yuriy Dorn, 2014, 1405.7630.

Relatively Smooth Convex Optimization by First-Order Methods, and Applications

Yurii Nesterov, Haihao Lu, Robert M. Freund, 2016, SIAM J. Optim..

Subgradient ellipsoid method for nonsmooth convex problems

Anton Rodomanov, Yurii Nesterov, Y. Nesterov, 2021, Mathematical Programming.

Optimization Methods for Fully Composite Problems

Yurii Nesterov, Nikita Doikov, Y. Nesterov, 2021, 2103.12632.

Primal–dual accelerated gradient methods with small-dimensional relaxation oracle

Alexander Gasnikov, Yurii Nesterov, Pavel Dvurechensky, 2018, Optim. Methods Softw..

Inexact Tensor Methods with Dynamic Accuracies

Yurii Nesterov, Nikita Doikov, Y. Nesterov, 2020, ICML.

Increasing Training Stability for Deep CNNS

Jenny Benois-Pineau, Yurii Nesterov, Akka Zemmari, 2018, 2018 25th IEEE International Conference on Image Processing (ICIP).

Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization

Yurii Nesterov, François Glineur, Olivier Devolder, 2012, SIAM J. Optim..

Indirect reciprocity through gossiping can lead to cooperative clusters

Vincent A. Traag, Paul Van Dooren, Yurii Nesterov, 2011, 2011 IEEE Symposium on Artificial Life (ALIFE).

Exponential Ranking: Taking into Account Negative Links

Vincent A. Traag, Paul Van Dooren, Yurii Nesterov, 2010, SocInfo.

Discrete Choice Prox-Functions on the Simplex

Yurii Nesterov, Vladimir Shikhman, David Müller, 2019, Math. Oper. Res..

Positivity and Linear Matrix Inequalities

Y. Nesterov, R. Ştefan, Y. Hachez, 2002, Eur. J. Control.

Complexity estimates of some cutting plane methods based on the analytic barrier

Yurii Nesterov, Y. Nesterov, 1995, Math. Program..

Narrow scope for resolution-free community detection pdf

Vincent A. Traag, Paul Van Dooren, Yurii Nesterov, 2011, ArXiv.

Narrow scope for resolution-limit-free community detection.

V A Traag, P Van Dooren, Y Nesterov, 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

Set-Limited Functions and Polynomial-Time Interior-Point Methods

Y. Nesterov, 2023, Journal of Optimization Theory and Applications.

Affine-invariant contracting-point methods for Convex Optimization

Yurii Nesterov, Nikita Doikov, Y. Nesterov, 2020, Mathematical Programming.

Gradient regularization of Newton method with Bregman distances

Yurii Nesterov, Nikita Doikov, Y. Nesterov, 2021, Mathematical Programming.

Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure

Y. Nesterov, 2021, SIAM Journal on Optimization.

Superfast Second-Order Methods for Unconstrained Convex Optimization

Yurii Nesterov, Y. Nesterov, 2020, Journal of Optimization Theory and Applications.

Greedy Quasi-Newton Methods with Explicit Superlinear Convergence

Anton Rodomanov, Yurii Nesterov, Y. Nesterov, 2020, SIAM J. Optim..

Unconstrained Convex Minimization in Relative Scale

Yurii Nesterov, Y. Nesterov, 2003, Math. Oper. Res..

Rounding of convex sets and efficient gradient methods for linear programming problems

Yurii Nesterov, Y. Nesterov, 2004, Optim. Methods Softw..

Nearest stable system using successive convex approximations

Paul Van Dooren, Yurii Nesterov, Francois-Xavier Orbandexivry, 2013, Autom..

Mathematical Programming Society Newsletter Structural Convex Optimization 2 MPS Chair ’ s Column 6 Smooth Semidefinite Optimization 9 Mathematical Programming Computation : A New MPS Journal

Y. Nesterov, 2008 .

How to advance in Structural Convex Optimization

Yurii Nesterov, Y. Nesterov, Yurii Nesterov, 2008 .

Modified Gauss–Newton scheme with worst case guarantees for global performance

Yurii Nesterov, Y. Nesterov, 2007, Optim. Methods Softw..

Fast Fourier Transform and its Applications to Integer Knapsack Problems

Yurii Nesterov, Y. Nesterov, 2004 .

Interior-point methods: An old and new approach to nonlinear programming

Yu. Nesterov, Y. Nesterov, 1997, Math. Program..

Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization

Yu. Nesterov, V. Shikhman, Y. Nesterov, 2015, J. Optim. Theory Appl..

Subgradient Methods for Huge-scale Optimization Problems Yurii Nesterov Subgradient Methods for Huge-scale Optimization Problems

Y. Nesterov, Yu Nesterov, 2022 .

Inexact accelerated high-order proximal-point methods

Yurii Nesterov, Y. Nesterov, 2021, Mathematical Programming.

On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods

Michael J. Todd, Yurii Nesterov, Y. Nesterov, 2002, Found. Comput. Math..

Cubic regularization of a Newton scheme and its global performance

Yurii Nesterov, Boris T. Polyak, Boris Polyak, 2003 .

Adaptive Third-Order Methods for Composite Convex Optimization

Y. Nesterov, G. N. Grapiglia, 2022, SIAM J. Optim..

High-order methods beyond the classical complexity bounds, II: inexact high-order proximal-point methods with segment search

Yurii Nesterov, Masoud Ahookhosh, Y. Nesterov, 2021, 2109.12303.

An interior-point method for generalized linear-fractional programming

Yurii Nesterov, A. S. Nemirovskii, A. Nemirovskii, 1995, Math. Program..

New Results on Superlinear Convergence of Classical Quasi-Newton Methods

Anton Rodomanov, Yurii Nesterov, Y. Nesterov, 2020, Journal of Optimization Theory and Applications.

Rates of superlinear convergence for classical quasi-Newton methods

Y. Nesterov, Anton Rodomanov, 2020, Mathematical Programming.

Computational Methods for the Stable Dynamic Model

Yurii Nesterov, Anton Anikin, Yuriy Dorn, 2019 .

Stable Traffic Equilibria: Properties and Applications

Yurii Nesterov, Y. Nesterov, 2000 .

Long-step strategies in interior-point primal-dual methods

Yurii Nesterov, Y. Nesterov, 1997, Math. Program..

Complexity bounds for primal-dual methods minimizing the model of objective function

Yurii Nesterov, Y. Nesterov, Yurii Nesterov, 2017, Mathematical Programming.

Central path and Riemannian distances

Yurii Nesterov, Arkadi Nemirovski, Y. Nesterov, 2003 .

Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems

Michael J. Todd, Yurii Nesterov, Yinyu Ye, 1999, Math. Program..

A Subgradient Method for Free Material Design

Yurii Nesterov, Yu Xia, Michal Kocvara, 2016, SIAM J. Optim..

Towards non-symmetric conic optimization

Yurii Nesterov, Y. Nesterov, 2012, Optim. Methods Softw..

Finding the stationary states of Markov chains by iterative methods

Yurii Nesterov, Arkadi Nemirovski, Y. Nesterov, 2015, Appl. Math. Comput..

On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient

Guillaume O. Berger, Yurii Nesterov, Raphael M. Jungers, 2020, Journal of Optimization Theory and Applications.

Dual Methods for Finding Equilibriums in Mixed Models of Flow Distribution in Large Transportation Networks

Y. Nesterov, A. Gasnikov, E. Gasnikova, 2018, Computational Mathematics and Mathematical Physics.

Universal Method for Stochastic Composite Optimization Problems

Y. Nesterov, A. Gasnikov, 2018, Computational Mathematics and Mathematical Physics.

Primal-dual method for searching equillibriums in mixed traffic assignment problems

Y. Nesterov, A. Gasnikov, E. Gasnikova, 2016, 1604.08183.

Stochastic gradient methods with inexact oracle

Y. Nesterov, P. Dvurechensky, A. Gasnikov, 2014, 1411.4218.

Parabolic target space and primal-dual interior-point methods

Yurii Nesterov, Y. Nesterov, 2008, Discret. Appl. Math..

Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems

Yurii Nesterov, S. Shpirko, Y. Nesterov, 2014, SIAM J. Optim..

Efficient numerical methods for entropy-linear programming problems

Y. Nesterov, A. Gasnikov, E. Gasnikova, 2016, Computational Mathematics and Mathematical Physics.

Minimizing Functions with Bounded Variation of Subgradients

Yurii Nesterov, Y. Nesterov, 2005 .

Conic optimization-based algorithms for nonnegative matrix factorization

Y. Nesterov, Nicolas Gillis, F. Glineur, 2021, Optim. Methods Softw..

Computing Closest Stable Nonnegative Matrix

Y. Nesterov, V. Yu. Protasov, Y. Nesterov, 2020, SIAM J. Matrix Anal. Appl..

Smooth Convex Optimization

Yurii Nesterov, Y. Nesterov, 2004 .

Algorithmic models of market equilibrium

Vladimir Shikhman, Y. Nesterov, V. Shikhman, 2013 .

Algorithmic Models of Market Equilibrium Yurii NESTEROV

Y. Nesterov, V. Shikhman, 2022 .

Nonsmooth Convex Optimization

Y. Nesterov, 2004 .

Dual subgradient method with averaging for optimal resource allocation

Yurii Nesterov, Vladimir Shikhman, Y. Nesterov, 2017, Eur. J. Oper. Res..

Optimizing the Coupling Between Two Isometric Projections of Matrices

Paul Van Dooren, Yurii Nesterov, Catherine Fraikin, 2008, SIAM J. Matrix Anal. Appl..

Correlation between Two Projected Matrices Under Isometry Constraints

Yurii Nesterov, Catherine Fraikin, Paul Van Dooren, 2005 .

Correlation between orthogonally projected matrices

Y. Nesterov, P. Dooren, Catherine Fraikin, 2006 .

Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions

Yurii Nesterov, Geovani Nunes Grapiglia, Y. Nesterov, 2019, SIAM J. Optim..

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians

Yurii Nesterov, Geovani Nunes Grapiglia, Y. Nesterov, 2017, SIAM J. Optim..

Exact Nonnegative Matrix Factorization via Conic Optimization

Yurii Nesterov, Nicolas Gillis, Franccois Glineur, 2021 .

Efficient numerical methods to solve sparse linear equations with application to PageRank

Alexander Gasnikov, Yurii Nesterov, Anton Anikin, 2015, Optim. Methods Softw..

Linear convergence of first order methods for non-strongly convex optimization

Y. Nesterov, I. Necoara, F. Glineur, 2018, Mathematical Programming.

Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks

Yurii Nesterov, Ion Necoara, François Glineur, 2015, J. Optim. Theory Appl..

Linear convergence of first order methods for non-strongly convex optimization

Y. Nesterov, I. Necoara, F. Glineur, 2015, Mathematical Programming.

Adaptive Third-Order Methods for Composite Convex Optimization

Y. Nesterov, G. N. Grapiglia, 2022, SIAM J. Optim..

Optimization Problems over Positive Pseudopolynomial Matrices

Paul Van Dooren, Yurii Nesterov, Yves V. Genin, 2003, SIAM J. Matrix Anal. Appl..

Optimization over positive polynomial matrices

Paul Van Dooren, Yurii Nesterov, Yves Genin, 2000 .

Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices

Vincent D. Blondel, Yurii Nesterov, Y. Nesterov, 2009, SIAM J. Matrix Anal. Appl..

Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives

Y. Nesterov, G. N. Grapiglia, 2019, SIAM J. Optim..

Primal Central Paths and Riemannian Distances for Convex Sets

Y. Nesterov, A. Nemirovski, 2008, Found. Comput. Math..

Primal Central Paths and Riemannian Distances for Convex Sets

Yurii Nesterov, Arkadi Nemirovski, Y. Nesterov, 2022 .

Modified Gauss–Newton scheme with worst case guarantees for global performance

Y. Nesterov, 2007, Optim. Methods Softw..

Computing the joint spectral radius of a set of matrices

Vincent D. Blondel, Yurii Nesterov, Jacques Theys, 2004 .