Yurii E. Nesterov

Orcid: 0000-0002-0542-8757

Affiliations:
  • Catholic University of Louvain (UCL), CORE, Louvain-la-Neuve, Belgium


According to our database1, Yurii E. Nesterov authored at least 108 papers between 1991 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Super-Universal Regularized Newton Method.
SIAM J. Optim., March, 2024

Gradient regularization of Newton method with Bregman distances.
Math. Program., March, 2024

2023
Adaptive Third-Order Methods for Composite Convex Optimization.
SIAM J. Optim., September, 2023

Conic optimization-based algorithms for nonnegative matrix factorization.
Optim. Methods Softw., July, 2023

Subgradient ellipsoid method for nonsmooth convex problems.
Math. Program., May, 2023

Affine-invariant contracting-point methods for Convex Optimization.
Math. Program., March, 2023

Inexact accelerated high-order proximal-point methods.
Math. Program., January, 2023

2022
High-Order Optimization Methods for Fully Composite Problems.
SIAM J. Optim., September, 2022

Gradient methods with memory.
Optim. Methods Softw., 2022

Inexact basic tensor methods for some classes of convex optimization problems.
Optim. Methods Softw., 2022

Tensor methods for finding approximate stationary points of convex functions.
Optim. Methods Softw., 2022

Efficient numerical methods to solve sparse linear equations with application to PageRank.
Optim. Methods Softw., 2022

Rates of superlinear convergence for classical quasi-Newton methods.
Math. Program., 2022

Local convergence of tensor methods.
Math. Program., 2022

Discrete Choice Prox-Functions on the Simplex.
Math. Oper. Res., 2022

2021
Greedy Quasi-Newton Methods with Explicit Superlinear Convergence.
SIAM J. Optim., 2021

Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure.
SIAM J. Optim., 2021

Primal-dual accelerated gradient methods with small-dimensional relaxation oracle.
Optim. Methods Softw., 2021

On inexact solution of auxiliary problems in tensor methods for convex optimization.
Optim. Methods Softw., 2021

Implementable tensor methods in unconstrained convex optimization.
Math. Program., 2021

New Results on Superlinear Convergence of Classical Quasi-Newton Methods.
J. Optim. Theory Appl., 2021

Superfast Second-Order Methods for Unconstrained Convex Optimization.
J. Optim. Theory Appl., 2021

Minimizing Uniformly Convex Functions by Cubic Regularization of Newton Method.
J. Optim. Theory Appl., 2021

2020
Soft clustering by convex electoral model.
Soft Comput., 2020

Computing Closest Stable Nonnegative Matrix.
SIAM J. Matrix Anal. Appl., 2020

Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives.
SIAM J. Optim., 2020

Contracting Proximal Methods for Smooth Convex Optimization.
SIAM J. Optim., 2020

Smoothness Parameter of Power of Euclidean Norm.
J. Optim. Theory Appl., 2020

On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient.
J. Optim. Theory Appl., 2020

Convex optimization based on global lower second-order models.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Stochastic Subspace Cubic Newton Method.
Proceedings of the 37th International Conference on Machine Learning, 2020

Inexact Tensor Methods with Dynamic Accuracies.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Accelerated Regularized Newton Methods for Minimizing Composite Convex Functions.
SIAM J. Optim., 2019

Linear convergence of first order methods for non-strongly convex optimization.
Math. Program., 2019

2018
Relatively Smooth Convex Optimization by First-Order Methods, and Applications.
SIAM J. Optim., 2018

Complexity bounds for primal-dual methods minimizing the model of objective function.
Math. Program., 2018

Dual subgradient method with averaging for optimal resource allocation.
Eur. J. Oper. Res., 2018

Increasing Training Stability for Deep CNNS.
Proceedings of the 2018 IEEE International Conference on Image Processing, 2018

2017
Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems.
SIAM J. Optim., 2017

Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians.
SIAM J. Optim., 2017

Distributed Price Adjustment Based on Convex Analysis.
J. Optim. Theory Appl., 2017

Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks.
J. Optim. Theory Appl., 2017

Preface to the Special Issue "Optimization, Control and Applications" in Honor of Boris T. Polyak's 80th Birthday.
J. Optim. Theory Appl., 2017

Random Gradient-Free Minimization of Convex Functions.
Found. Comput. Math., 2017

2016
Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems.
SIAM J. Optim., 2016

A Subgradient Method for Free Material Design.
SIAM J. Optim., 2016

Learning Supervised PageRank with Gradient-Based and Gradient-Free Optimization Methods.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Universal gradient methods for convex optimization problems.
Math. Program., 2015

Quasi-monotone Subgradient Methods for Nonsmooth Convex Minimization.
J. Optim. Theory Appl., 2015

Primal-Dual Methods for Solving Infinite-Dimensional Games.
J. Optim. Theory Appl., 2015

Finding the stationary states of Markov chains by iterative methods.
Appl. Math. Comput., 2015

Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction.
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015

2014
Primal-Dual Subgradient Method for Huge-Scale Linear Conic Problems.
SIAM J. Optim., 2014

Subgradient methods for huge-scale optimization problems.
Math. Program., 2014

First-order methods of smooth convex optimization with inexact oracle.
Math. Program., 2014

2013
Optimizing the Spectral Radius.
SIAM J. Matrix Anal. Appl., 2013

Hessian distances and their applications in the complexity analysis of interior-point methods.
Optim. Methods Softw., 2013

Gradient methods for minimizing composite functions.
Math. Program., 2013

Nearest stable system using successive convex approximations.
Autom., 2013

On first-order algorithms for l1/nuclear norm minimization.
Acta Numer., 2013

2012
Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems.
SIAM J. Optim., 2012

Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization.
SIAM J. Optim., 2012

Towards non-symmetric conic optimization.
Optim. Methods Softw., 2012

Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.
Math. Program., 2012

Design and Operations of Gas Transmission Networks.
Oper. Res., 2012

2011
Barrier subgradient method.
Math. Program., 2011

Narrow scope for resolution-free community detection
CoRR, 2011

Indirect reciprocity through gossiping can lead to cooperative clusters.
Proceedings of the 2011 IEEE Symposium on Artificial Life, 2011

2010
Generalized Power Method for Sparse Principal Component Analysis.
J. Mach. Learn. Res., 2010

Exponential Ranking: Taking into Account Negative Links.
Proceedings of the Social Informatics - Second International Conference, 2010

2009
Polynomial-Time Computation of the Joint Spectral Radius for Some Sets of Nonnegative Matrices.
SIAM J. Matrix Anal. Appl., 2009

Primal-dual subgradient methods for convex problems.
Math. Program., 2009

Foreword: special issue on nonsmooth optimization and applications.
Math. Program., 2009

Unconstrained Convex Minimization in Relative Scale.
Math. Oper. Res., 2009

2008
Optimizing the Coupling Between Two Isometric Projections of Matrices.
SIAM J. Matrix Anal. Appl., 2008

Rounding of convex sets and efficient gradient methods for linear programming problems.
Optim. Methods Softw., 2008

Accelerating the cubic regularization of Newton's method on convex problems.
Math. Program., 2008

Primal Central Paths and Riemannian Distances for Convex Sets.
Found. Comput. Math., 2008

Parabolic target space and primal-dual interior-point methods.
Discret. Appl. Math., 2008

Confidence level solutions for stochastic programming.
Autom., 2008

2007
Modified Gauss-Newton scheme with worst case guarantees for global performance.
Optim. Methods Softw., 2007

Smoothing Technique and its Applications in Semidefinite Optimization.
Math. Program., 2007

Dual extrapolation and its applications to solving variational inequalities and related problems.
Math. Program., 2007

2006
Cubic regularization of Newton method and its global performance.
Math. Program., 2006

2005
Computationally Efficient Approximations of the Joint Spectral Radius.
SIAM J. Matrix Anal. Appl., 2005

Excessive Gap Technique in Nonsmooth Convex Minimization.
SIAM J. Optim., 2005

Lexicographic differentiation of nonsmooth functions.
Math. Program., 2005

Smooth minimization of non-smooth functions.
Math. Program., 2005

2004
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity.
Math. Program., 2004

Approximations of the Rate of Growth of Switched Linear Systems.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

Introductory Lectures on Convex Optimization - A Basic Course
Applied Optimization 87, Springer, ISBN: 978-1-4419-8853-9, 2004

2003
Optimization Problems over Positive Pseudopolynomial Matrices.
SIAM J. Matrix Anal. Appl., 2003

2002
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods.
Found. Comput. Math., 2002

Positivity and Linear Matrix Inequalities.
Eur. J. Control, 2002

1999
Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities.
SIAM J. Optim., 1999

Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems.
Math. Program., 1999

The analytic center of LMI's and Riccati equations.
Proceedings of the 5th European Control Conference, 1999

Positive transfer functions and convex optimization.
Proceedings of the 5th European Control Conference, 1999

1998
Primal-Dual Interior-Point Methods for Self-Scaled Cones.
SIAM J. Optim., 1998

Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods.
Math. Oper. Res., 1998

1997
Interior-point methods: An old and new approach to nonlinear programming.
Math. Program., 1997

Self-Scaled Barriers and Interior-Point Methods for Convex Programming.
Math. Oper. Res., 1997

1996
Long-step strategies in interior-point primal-dual methods.
Math. Program., 1996

1995
An interior-point method for generalized linear-fractional programming.
Math. Program., 1995

Complexity estimates of some cutting plane methods based on the analytic barrier.
Math. Program., 1995

New variants of bundle methods.
Math. Program., 1995

1994
Interior-point polynomial algorithms in convex programming.
Siam studies in applied mathematics 13, SIAM, ISBN: 978-0-89871-319-0, 1994

1991
Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem.
SIAM J. Optim., 1991


  Loading...