Fenchel Dual Gradient Methods for Distributed Convex Optimization Over Time-Varying Networks
From MaRDI portal
Publication:5211221
DOI10.1109/TAC.2019.2901829zbMath1482.90160arXiv1708.07620OpenAlexW2963524119WikidataQ128383892 ScholiaQ128383892MaRDI QIDQ5211221
Publication date: 28 January 2020
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.07620
Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Deterministic network models in operations research (90B10)
Related Items (5)
Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs ⋮ A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks ⋮ SOLO FTRL algorithm for production management with transfer prices ⋮ Decentralized convex optimization on time-varying networks with application to Wasserstein barycenters ⋮ Projected subgradient based distributed convex optimization with transmission noises
This page was built for publication: Fenchel Dual Gradient Methods for Distributed Convex Optimization Over Time-Varying Networks