Optimal Distributed Convex Optimization on Slowly Time-Varying Graphs

DOI10.1109/TCNS.2019.2949439MaRDI QIDQ4969435zbMATH OpenFDO

Authors Alexander Rogozin, César A. Uribe, Nikolay Malkovsky, Angelia Nedić, 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)

Cited in

(17)

• Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions
• Distributed convex optimization with coupling constraints over time-varying directed graphs
• Online accelerated data-driven learning for optimal feedback control of discrete-time partially uncertain systems
• Distributed nonconvex constrained optimization over time-varying digraphs
• Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
• Distributed algorithms for computing a fixed point of multi-agent nonexpansive operators
• A distributed accelerated optimization algorithm over time‐varying directed graphs with uncoordinated step‐sizes
• Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs
• Distributed Optimization Over Time-Varying Graphs With Imperfect Sharing of Information
• Optimal gradient tracking for decentralized optimization
• Near-Optimal Decentralized Algorithms for Saddle Point Problems over Time-Varying Networks
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
• A dual approach for optimal algorithms in distributed optimization over networks
• Penalty-based method for decentralized optimization over time-varying graphs
• Optimal Distributed Optimization on Slowly Time-Varying Graphs
• A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969435)