RC Circuits based Distributed Conditional Gradient Method
arXiv:2003.06949
Abstract
We consider distributed optimization on undirected connected graphs. We propose a novel distributed conditional gradient method with (O(1/\sqrt{k})) convergence. Compared with existing methods, each iteration of our method uses both communication and linear minimization step only once rather than multiple times. We further extend our results to cases with composite local constraints. We demonstrate our results via examples on distributed matrix completion problem.
References in corpus (9)
- Constrained Consensus
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- On the Equivalence between Herding and Conditional Gradient Algorithms
- A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming
- A Distributed Frank-Wolfe Framework for Learning Low-Rank Matrices with the Trace Norm
- A Conditional Gradient-Based Augmented Lagrangian Framework
- Mass-spring-damper Networks for Distributed Optimization in Non-Euclidean Spaces
- RLC Circuits based Distributed Mirror Descent Method
- Communication-Efficient Projection-Free Algorithm for Distributed Optimization