Metraipolis › archive › dc_ba87f82be4d1

How to Look Inside the Black Box: A Survey of Yu. E. Nesterov's Contributions (On the Award of the 2026 Gauss Prize) — arXiv:2611.07114

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07114
License (as archived)
CC0-1.0
Archived
2026-11-06T14:51:55.857Z
SHA-256 of the archived text
3239d7a613262f1d91d0f6fee589baa879bcac3102fcdb8c14e56a993f95570f
Stable URL of this page
https://metraipolis.com/documento/dc_ba87f82be4d1

How to cite

How to Look Inside the Black Box: A Survey of Yu. E. Nesterov's Contributions (On the Award of the 2026 Gauss Prize) — arXiv:2611.07114 — arXiv (en), https://arxiv.org/abs/2611.07114 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba87f82be4d1 (Metraipolis archive dc_ba87f82be4d1, sha256 3239d7a613262f1d91d0f6fee589baa879bcac3102fcdb8c14e56a993f95570f)
BibTeX
@misc{dcba87f82be4d1,
  title = {How to Look Inside the Black Box: A Survey of Yu. E. Nesterov's Contributions (On the Award of the 2026 Gauss Prize) — arXiv:2611.07114},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07114},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba87f82be4d1; sha256 3239d7a613262f1d91d0f6fee589baa879bcac3102fcdb8c14e56a993f95570f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07114. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\pi/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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.07114 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:23:27.646Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).