collaborators

1 paper

math.OC2026

A Communication Complexity Lower Bound for Nonuniformly Convex Consensus Optimization

Demyan Yarmoshik, Maxim Klimenko

We study the communication complexity of convex decentralized optimization over time-varying networks, where nodes hold private functions and must agree on the global minimizer…