On the complexity of decentralized optimization via global function parameters
Russian Mathematical Surveys · 2026 · 81 (3) · 556-558
DOI: 10.4213/rm10278e ↗Kurz gefasst
Fachartikel in der Zeitschrift Russian Mathematical Surveys, online erschienen am 27.08.2026. Verfasst von Dmitry Aleksandrovich Kovalev und 3 weiteren Autor:innen. Die Arbeit nennt 6 Literaturangaben. Gefördert von: Ministry of Science and Higher Education of the Russian Federation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Ministry of Science and Higher Education of the Russian Federation
Zitieren
APA
Kovalev, D. A., Kupavskii, A. B., Rogozin, A. V., & Yarmoshik, D. V. (2026). On the complexity of decentralized optimization via global function parameters. Russian Mathematical Surveys, 81(3), 556-558. https://doi.org/10.4213/rm10278e
Vancouver
Kovalev DA, Kupavskii AB, Rogozin AV, Yarmoshik DV. On the complexity of decentralized optimization via global function parameters. Russian Mathematical Surveys. 2026;81(3):556-558. doi:10.4213/rm10278e
BibTeX
@article{Kovalev2026,
author = {Kovalev, Dmitry Aleksandrovich and Kupavskii, Andrey Borisovich and Rogozin, Alexander Viktorovich and Yarmoshik, Demyan Valer'evich},
title = {On the complexity of decentralized optimization via global function parameters},
journal = {Russian Mathematical Surveys},
year = {2026},
volume = {81},
number = {3},
pages = {556--558},
doi = {10.4213/rm10278e}
}
EUVIMED