Min-max optimization over slowly time-varying graphs

DOI10.1134/s1064562423701533arXiv2309.03769OpenAlexW4393142053MaRDI QIDQ6124386

No author found.

Publication date: 27 March 2024

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.03769

zbMATH Keywords

saddle point problemextragradient methoddecentralized optimizationtime-varying graph

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Multivariate analysis (62Hxx) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Fast Convergence Rates for Distributed Non-Bayesian Learning
• Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
• Convex Optimization in Signal Processing and Communications
• Decentralized optimization over slowly time-varying graphs: algorithms and lower bounds
• Towards accelerated rates for distributed optimization over time-varying networks
• Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks

This page was built for publication: Min-max optimization over slowly time-varying graphs