Optimal Distributed Convex Optimization on Slowly Time-Varying Graphs

DOI10.1109/TCNS.2019.2949439MaRDI QIDQ4969435

César A. Uribe, Angelia Nedić, Nikolay Malkovsky, Alexander Rogozin, Alexander V. Gasnikov

Publication date: 5 October 2020

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Systems theory; control (93-XX) Operations research, mathematical programming (90-XX)

Related Items (5)

A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks ⋮ Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators ⋮ Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks ⋮ Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems ⋮ A dual approach for optimal algorithms in distributed optimization over networks

This page was built for publication: Optimal Distributed Convex Optimization on Slowly Time-Varying Graphs