Asynchronous Distributed Optimization Via Randomized Dual Proximal Gradient

DOI10.1109/TAC.2016.2607023zbMath1366.90163arXiv1509.08373OpenAlexW2963590077MaRDI QIDQ5280397

Ivano Notarnicola, Giuseppe Notarstefano

Publication date: 27 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Distributed algorithms (68W15)

Related Items (8)

Decentralized proximal splitting algorithms for composite constrained convex optimization ⋮ Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks ⋮ An asynchronous subgradient-proximal method for solving additive convex optimization problems ⋮ A distributed proximal gradient method with time-varying delays for solving additive convex optimizations ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ A distributed asynchronous method of multipliers for constrained nonconvex optimization ⋮ An Optimal Algorithm for Decentralized Finite-Sum Optimization ⋮ Distributed composite optimization for multi-agent systems with asynchrony

This page was built for publication: Asynchronous Distributed Optimization Via Randomized Dual Proximal Gradient