Linear convergence of a dual optimization formulation for distributed optimization on directed graphs with unreliable communications
From MaRDI portal
Publication:6310341
arXiv1811.11380MaRDI QIDQ6310341FDOQ6310341
Authors: C. H. Jeffrey Pang 
Publication date: 27 November 2018
Abstract: This work builds on our recent work on a distributed optimization algorithm for graphs with directed unreliable communications. We show its linear convergence when we take either the proximal of each function or an affine minorant for when the function is smooth.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Distributed algorithms (68W15)
This page was built for publication: Linear convergence of a dual optimization formulation for distributed optimization on directed graphs with unreliable communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6310341)
