Yurii E. Nesterov
Orcid: 0000-0002-0542-8757Affiliations:
- Catholic University of Louvain (UCL), CORE, Louvain-la-Neuve, Belgium
According to our database1,
Yurii E. Nesterov
authored at least 112 papers
between 1991 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2024
Correction: High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods.
Math. Program., November, 2024
High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods.
Math. Program., November, 2024
J. Optim. Theory Appl., July, 2024
Math. Program., March, 2024
Optim. Methods Softw., 2024
2023
SIAM J. Optim., September, 2023
Optim. Methods Softw., July, 2023
Math. Program., May, 2023
Math. Program., March, 2023
2022
SIAM J. Optim., September, 2022
Optim. Methods Softw., 2022
Optim. Methods Softw., 2022
Efficient numerical methods to solve sparse linear equations with application to PageRank.
Optim. Methods Softw., 2022
Math. Program., 2022
2021
SIAM J. Optim., 2021
SIAM J. Optim., 2021
Optim. Methods Softw., 2021
Optim. Methods Softw., 2021
Math. Program., 2021
J. Optim. Theory Appl., 2021
J. Optim. Theory Appl., 2021
J. Optim. Theory Appl., 2021
2020
Tensor Methods for Minimizing Convex Functions with Hölder Continuous Higher-Order Derivatives.
SIAM J. Optim., 2020
On the Quality of First-Order Approximation of Functions with Hölder Continuous Gradient.
J. Optim. Theory Appl., 2020
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
Proceedings of the 37th International Conference on Machine Learning, 2020
2019
SIAM J. Optim., 2019
Math. Program., 2019
2018
SIAM J. Optim., 2018
Complexity bounds for primal-dual methods minimizing the model of objective function.
Math. Program., 2018
Eur. J. Oper. Res., 2018
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
SIAM J. Optim., 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
2016
Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems.
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
J. Optim. Theory Appl., 2015
J. Optim. Theory Appl., 2015
Appl. Math. Comput., 2015
Proceedings of the Algorithmic Game Theory - 8th International Symposium, 2015
2014
SIAM J. Optim., 2014
Math. Program., 2014
2013
Hessian distances and their applications in the complexity analysis of interior-point methods.
Optim. Methods Softw., 2013
2012
SIAM J. Optim., 2012
SIAM J. Optim., 2012
Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes.
Math. Program., 2012
2011
Proceedings of the 2011 IEEE Symposium on Artificial Life, 2011
2010
J. Mach. Learn. Res., 2010
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
Math. Program., 2009
2008
SIAM J. Matrix Anal. Appl., 2008
Rounding of convex sets and efficient gradient methods for linear programming problems.
Optim. Methods Softw., 2008
Math. Program., 2008
Found. Comput. Math., 2008
Discret. Appl. Math., 2008
2007
Optim. Methods Softw., 2007
Math. Program., 2007
Dual extrapolation and its applications to solving variational inequalities and related problems.
Math. Program., 2007
2006
Math. Program., 2006
2005
SIAM J. Matrix Anal. Appl., 2005
2004
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity.
Math. Program., 2004
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004
Applied Optimization 87, Springer, ISBN: 978-1-4419-8853-9, 2004
2003
SIAM J. Matrix Anal. Appl., 2003
2002
On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods.
Found. Comput. Math., 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
Proceedings of the 5th European Control Conference, 1999
Proceedings of the 5th European Control Conference, 1999
1998
Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods.
Math. Oper. Res., 1998
1997
Math. Program., 1997
Math. Oper. Res., 1997
1996
1995
Math. Program., 1995
Math. Program., 1995
1994
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