How to Look Inside the Black Box: A Survey of Yu. E. Nesterov's Contributions (On the Award of the 2026 Gauss Prize)
Abstract
On July 23, 2026, at the opening of the International Congress of Mathematicians in Philadelphia, the International Mathematical Union announced the award of the Gauss Prize to Yurii Evgenievich Nesterov -- an award for mathematical work with significant applications outside mathematics. This article explains the mathematical content of the recognized work of Yu. E. Nesterov and traces its influence on modern computational practice. The exposition is based on a concept that Yu. E. Nesterov himself regards as one of his main results: the classical complexity theory of convex optimization is oriented toward a black-box oracle, but its pessimistic bounds can be overcome by using a priori information about the internal structure of the objective function. We trace Yu. E. Nesterov's scientific career, then introduce the language of oracle complexity together with a classification of objective function models (geometric, algebraic, and structural), and subsequently discuss his main results in chronological order: the fast gradient method, fast automatic differentiation, the theory of self-concordant barriers and polynomial-time interior-point methods, the π/2 theorem, the stable dynamics model of traffic flows, the smoothing technique, primal-dual methods, cubic regularization of Newton's method, the modified Gauss--Newton scheme, coordinate descent methods and methods for huge-scale problems, gradient-free methods, universal gradient methods, implementable tensor methods, and "superfast" methods. Each topic is accompanied by historical background, precise statements specifying the problem class, oracle, and type of guarantee, examples, and a discussion of the current state of the art.
Related
- When Are Nesterov Trajectories Eventually Locally Minimizing?
- Improved Gradient Descent Lower Bounds Beyond Nesterov
- On the Nonoccurrence of Gradient Restart in Nesterov Accelerated Gradient Method
- Geometric Moment Contraction for Stochastic Nesterov Acceleration
- Continuized Nesterov Momentum Achieves the O(ε−7/4) Complexity in Smooth Nonconvex Optimization
BibTeX
@misc{gasnikov2026look,
title = {{How to Look Inside the Black Box: A Survey of Yu. E. Nesterov's Contributions (On the Award of the 2026 Gauss Prize)}},
author = {A. V. Gasnikov and A. Yu. Gornov and D. M. Dvinskikh and Yu. V. Dorn and D. I. Kamzolov and Yu. V. Maximov and V. V. Matyukhin and R. F. Hildebrand},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.07114},
eprint = {2611.07114},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.07114},
}
RIS
TY - UNPB
TI - How to Look Inside the Black Box: A Survey of Yu. E. Nesterov's Contributions (On the Award of the 2026 Gauss Prize)
AU - A. V. Gasnikov
AU - A. Yu. Gornov
AU - D. M. Dvinskikh
AU - Yu. V. Dorn
AU - D. I. Kamzolov
AU - Yu. V. Maximov
AU - V. V. Matyukhin
AU - R. F. Hildebrand
PY - 2026
DA - 2026/11/03
PB - arXiv
DO - 10.48550/arxiv.2611.07114
UR - https://arxiv.org/abs/2611.07114
AB - On July 23, 2026, at the opening of the International Congress of Mathematicians in Philadelphia, the International Mathematical Union announced the award of the Gauss Prize to Yurii Evgenievich Nesterov -- an award for mathematical work with significant applications outside mathematics. This article explains the mathematical content of the recognized work of Yu. E. Nesterov and traces its influence on modern computational practice. The exposition is based on a concept that Yu. E. Nesterov himself regards as one of his main results: the classical complexity theory of convex optimization is oriented toward a black-box oracle, but its pessimistic bounds can be overcome by using a priori information about the internal structure of the objective function. We trace Yu. E. Nesterov's scientific career, then introduce the language of oracle complexity together with a classification of objective function models (geometric, algebraic, and structural), and subsequently discuss his main results in chronological order: the fast gradient method, fast automatic differentiation, the theory of self-concordant barriers and polynomial-time interior-point methods, the π/2 theorem, the stable dynamics model of traffic flows, the smoothing technique, primal-dual methods, cubic regularization of Newton's method, the modified Gauss--Newton scheme, coordinate descent methods and methods for huge-scale problems, gradient-free methods, universal gradient methods, implementable tensor methods, and "superfast" methods. Each topic is accompanied by historical background, precise statements specifying the problem class, oracle, and type of guarantee, examples, and a discussion of the current state of the art.
ER -