Fetching the paper…
Reading the bibliography…
Given an undirected graph $\mathcal{G}=(\mathcal{N},\mathcal{E})$ of agents $\mathcal{N}=\{1,\ldots,N\}$ connected with edges in $\mathcal{E}$, we study how to compute an optimal decision on which there is consensus among agents and that minimizes the sum of agent-specific private convex composite functions $\{\Phi_i\}_{i\in\mathcal{N}}$ while respecting privacy requirements, where $\Phi_i\triangleq \xi_i + f_i$ belongs to agent-$i$.
Problems in Decentralized Decision Making and Computation
J. N. Tsitsiklis · 1984
Earlier work this paper cites.
Breakdown points of affine equivariant estimators of multivariate location and covariance matrices
Hendrik P Lopuhaa and Peter J Rousseeuw · 1991
Earlier work this paper cites.
Convex analysis
Ralph Tyrell Rockafellar · 1997
Earlier work this paper cites.
Distributed sensor networks: A multiagent perspective
Victor Lesser, Charles L Ortiz Jr, and Milind Tambe · 2003
Earlier work this paper cites.
Consensus in ad hoc WSNs with noisy links - Part I: Distributed estimation of deterministic signals
Ioannis D Schizas, Alejandro Ribeiro, and Georgios B Giannakis · 2008
Earlier work this paper cites.
On accelerated proximal gradient methods for convex-concave optimization
Paul Tseng · 2008
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedic and Asuman Ozdaglar · 2009
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
A. Beck and M. Teboulle · 2009
Earlier work this paper cites.
Decentralized sparse signal recovery for compressive sleeping wireless sensor networks
Qing Ling and Zhi Tian · 2010
Earlier work this paper cites.
Consensus-based distributed support vector machines
Pedro A Forero, Alfonso Cano, and Georgios B Giannakis · 2010
Earlier work this paper cites.
Distributed training strategies for the structured perceptron
Ryan McDonald, Keith Hall, and Gideon Mann · 2010
Earlier work this paper cites.
Distributed sparse linear regression
Gonzalo Mateos, Juan Andrés Bazerque, and Georgios B Giannakis · 2010
Earlier work this paper cites.
Distributed subgradient methods for convex optimization over random networks
Ilan Lobel and Asuman Ozdaglar · 2011
Earlier work this paper cites.
Dual averaging for distributed optimization: Convergence analysis and network scaling
J. C. Duchi, A. Agarwal, and M. J. Wainwright · 2012
Cited alongside, same era.
Distributed alternating direction method of multipliers
Ermin Wei and Asuman Ozdaglar · 2012
Cited alongside, same era.
A fast distributed proximal-gradient method
Annie I Chen and Asuman Ozdaglar · 2012
Cited alongside, same era.
Push-sum distributed dual averaging for convex optimization
Konstantinos I Tsianos, Sean Lawlor, and Michael G Rabbat · 2012
Cited alongside, same era.
On the 𝒪 ( 1 / n ) \mathcal{O}(1/n) convergence rate of the douglas-rachford alternating direction method
Bingsheng He and Xiaoming Yuan · 2012
Cited alongside, same era.
Distributed autonomous online learning: Regrets and intrinsic privacy-preserving properties
F. Yan, S. Sundaram, S. Vishwanathan, and Y. Qi · 2013
Fast first-order methods for composite convex optimization with backtracking
K. Scheinberg, D. Goldfarb, and X. Bai · 2014
Later among the works it cites.
Multi-agent distributed optimization via inexact consensus ADMM
T.-H. Chang, M. Hong, and X. Wang · 2015
Closest in time.
Distributed iterative thresholding for ℓ 0 / ℓ 1 \ell_{0}/\ell_{1} -regularized linear inverse problems
Chiara Ravazzi, Sophie Marie Fosson, and Enrico Magli · 2015
Closest in time.
On the ergodic convergence rates of a first-order primal–dual algorithm
Antonin Chambolle and Thomas Pock · 2015
Closest in time.
A proximal gradient algorithm for decentralized composite optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Closest in time.
An asynchronous distributed proximal gradient method for composite convex optimization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A primal–dual splitting method for convex optimization involving lipschitzian, proximable and linear composite terms
Laurent Condat · 2013
Cited alongside, same era.
On the o (1/k) convergence of asynchronous distributed alternating direction method of multipliers
Ermin Wei and Asuman Ozdaglar · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Yu Nesterov · 2013
Cited alongside, same era.
Broadcast-based distributed alternating direction method of multipliers
Ali Makhdoumi and Asuman Ozdaglar · 2014
Cited alongside, same era.
Fast distributed gradient methods
Dusan Jakovetic, Joao Xavier, and Jose MF Moura · 2014
Cited alongside, same era.
A stochastic primal-dual algorithm for distributed asynchronous composite optimization
Pascal Bianchi, Walid Hachem, and Franck Iutzeler · 2014
Cited alongside, same era.
N. S. Aybat, Z. Wang, and G. Iyengar · 2015
Closest in time.
Extra: An exact first-order algorithm for decentralized consensus optimization
Wei Shi, Qing Ling, Gang Wu, and Wotao Yin · 2015
Closest in time.
DLM: Decentralized linearized alternating direction method of multipliers
Q. Ling, W. Shi, G. Wu, and A. Ribeiro · 2015
Closest in time.
Stochastic proximal gradient consensus over random networks
Mingyi Hong and Tsung-Hui Chang · 2015
Closest in time.
Distributed optimization over time-varying directed graphs
Angelia Nedić and Alex Olshevsky · 2015
Closest in time.
An extragradient-based alternating direction method for convex minimization
T. Lin, S. Ma, and S. Zhang · 2015
Closest in time.
An alternating direction method with increasing penalty for stable principal component pursuit
N.S. Aybat and G. Iyengar · 2015
Closest in time.