Fetching the paper…
Reading the bibliography…
In this paper, we study the optimal convergence rate for distributed convex optimization problems in networks.
Reaching a consensus
Morris H DeGroot · 1974
Earlier work this paper cites.
Agreeing to disagree
Robert J. Aumann · 1976
Earlier work this paper cites.
Asymptotic agreement in distributed estimation
Vivek Borkar and Pravin P Varaiya · 1982
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadii Nemirovskii and Yudin · 1983
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate o (1/k2)
Yurii Nesterov · 1983
Earlier work this paper cites.
Convergence and asymptotic agreement in distributed decision problems
John N Tsitsiklis and Michael Athans · 1984
Earlier work this paper cites.
Combining probability distributions: A critique and an annotated bibliography
Christian Genest and James V. Zidek · 1986
Earlier work this paper cites.
Parallel and distributed computation: numerical methods
Dimitri P Bertsekas and John N Tsitsiklis · 1989
Earlier work this paper cites.
Statistics in expert resolution: A theory of weights for combining expert opinion
RogerM. Cooke · 1990
Earlier work this paper cites.
On reaching a consensus using degroot’s iterative pooling
Gustavo L. Gilardoni and Murray K. Clayton · 1993
Earlier work this paper cites.
Interior-point polynomial algorithms in convex programming
Yurii Nesterov and Arkadii Nemirovskii · 1994
Earlier work this paper cites.
Convex analysis and optimization
Dimitri P Bertsekas, Angelia Nedić, and Asuman E Ozdaglar · 2003
Earlier work this paper cites.
Decentralized source localization and tracking wireless sensor networks
M.G. Rabbat and R.D. Nowak · 2004
Earlier work this paper cites.
Sequential subspace optimization method for large-scale unconstrained problems
Guy Narkiss and Michael Zibulevsky · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu Nesterov · 2005
Earlier work this paper cites.
Optimal scaling of a gradient method for distributed resource allocation
Lin Xiao and Stephen Boyd · 2006
Earlier work this paper cites.
Decentralized resource allocation in dynamic networks of agents
Hariharan Lakshmanan and Daniela Pucci De Farias · 2008
Earlier work this paper cites.
A fast iterative shrinkage-thresholding algorithm for linear inverse problems
Amir Beck and Marc Teboulle · 2009
Earlier work this paper cites.
On distributed averaging algorithms and quantization effects
Angelia Nedić, Alexander Olshevsky, Asuman Ozdaglar, and John N Tsitsiklis · 2009
Earlier work this paper cites.
Distributed subgradient methods for multi-agent optimization
Angelia Nedić and Asuman Ozdaglar · 2009
Earlier work this paper cites.
Large-scale machine learning with stochastic gradient descent
Léon Bottou · 2010
Earlier work this paper cites.
Optimization and analysis of distributed averaging with short node memory
Boris N Oreshkin, Mark J Coates, and Michael G Rabbat · 2010
Earlier work this paper cites.
Distributed stochastic subgradient projection algorithms for convex optimization
S Sundhar Ram, Angelia Nedić, and Venugopal V Veeravalli · 2010
Earlier work this paper cites.
Distributed optimization and statistical learning via the alternating direction method of multipliers
Stephen Boyd, Neal Parikh, Eric Chu, Borja Peleato, and Jonathan Eckstein · 2011
Earlier work this paper cites.
First order methods for nonsmooth convex large-scale optimization, i: general purpose methods
Anatoli Juditsky and Arkadi Nemirovski · 2011
Earlier work this paper cites.
Primal-dual first-order methods with o ( 1 / ε ) o(1/\varepsilon) iteration-complexity for cone programming
Guanghui Lan, Zhaosong Lu, and Renato D. C. Monteiro · 2011
Cited alongside, same era.
Double smoothing technique for large-scale linearly constrained convex optimization
Olivier Devolder, François Glineur, and Yurii Nesterov · 2012
Cited alongside, same era.
Mlbase: A distributed machine-learning system
Tim Kraska, Ameet Talwalkar, John C Duchi, Rean Griffith, Michael J Franklin, and Michael I Jordan · 2013
Cited alongside, same era.
Analysis of accelerated gossip algorithms
Ji Liu, Brian DO Anderson, Ming Cao, and A Stephen Morse · 2013
Cited alongside, same era.
Random coordinate descent algorithms for multi-agent convex optimization over networks
I. Necoara · 2013
Cited alongside, same era.
Gradient methods for minimizing composite functions
Efficient numerical methods for entropy-linear programming problems
Alexander Vladimirovich Gasnikov, EB Gasnikova, Yu E Nesterov, and AV Chernov · 2016
Later among the works it cites.
Gradient sliding for composite optimization
Guanghui Lan · 2016
Later among the works it cites.
Achieving geometric convergence for distributed optimization over time-varying graphs
Angelia Nedić, Alex Olshevsky, and Wei Shi · 2016
Later among the works it cites.
Linearly convergent decentralized consensus optimization over directed networks
Angelia Nedić, Alex Olshevsky, and Wei Shi · 2016
Later among the works it cites.
Distributed gaussian learning over time-varying directed graphs
Angelia Nedić, Alex Olshevsky, and César A Uribe · 2016
Later among the works it cites.
Network independent rates in distributed learning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yu. Nesterov · 2013
Cited alongside, same era.
Introductory lectures on convex optimization: A basic course
Yurii Nesterov · 2013
Cited alongside, same era.
Linear coupling: An ultimate unification of gradient and mirror descent
Zeyuan Allen-Zhu and Lorenzo Orecchia · 2014
Cited alongside, same era.
Primal-dual subgradient methods for minimizing uniformly convex functions
Anatoli Iouditski and Yuri Nesterov · 2014
Cited alongside, same era.
Nonsmooth algorithms and nesterov’s smoothing technique for generalized fermat–torricelli problems
Nguyen Mau Nam, Nguyen Thai An, R Blake Rector, and Jie Sun · 2014
Cited alongside, same era.
Alex Olshevsky · 2014
Cited alongside, same era.
Proximal algorithms
Neal Parikh, Stephen Boyd, et al · 2014
Cited alongside, same era.
Angelia Nedić, Alex Olshevsky, and César A Uribe · 2016
Later among the works it cites.
Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
AS Anikin, AV Gasnikov, PE Dvurechensky, AI Tyurin, and AV Chernov · 2017
Closest in time.
Distributed resource allocation on dynamic networks in quadratic time
Thinh T Doan and Alex Olshevsky · 2017
Closest in time.
Gradient method with inexact oracle for composite non-convex optimization
Pavel Dvurechensky · 2017
Closest in time.
Convex optimization in hilbert space with applications to inverse problems
Alexander Gasnikov, Sergey Kabanikhin, Ahmed Mohamed, and Maxim Shishlenin · 2017
Closest in time.
Dissipativity theory for nesterov’s accelerated method
Bin Hu and Laurent Lessard · 2017
Closest in time.
A unification, generalization, and acceleration of exact distributed first order methods
Dusan Jakovetic · 2017
Closest in time.
Communication-efficient algorithms for decentralized and stochastic optimization
Guanghui Lan, Soomin Lee, and Yi Zhou · 2017
Closest in time.
Network topology and communication-computation tradeoffs in decentralized optimization
Angelia Nedić, Alex Olshevsky, and Michael G Rabbat · 2017
Closest in time.
Improved convergence rates for distributed resource allocation
Angelia Nedić, Alex Olshevsky, and Wei Shi · 2017
Closest in time.
Geometrically convergent distributed optimization with uncoordinated step-sizes
Angelia Nedić, Alex Olshevsky, Wei Shi, and César A Uribe · 2017
Closest in time.
Distributed learning for cooperative inference
Angelia Nedić, Alex Olshevsky, and César A Uribe · 2017
Closest in time.
Fast convergence rates for distributed non-bayesian learning
Angelia Nedić, Alex Olshevsky, and César A. Uribe · 2017
Closest in time.
Accelerated distributed nesterov gradient descent
Guannan Qu and Na Li · 2017
Closest in time.
Harnessing smoothness to accelerate distributed optimization
Guannan Qu and Na Li · 2017
Closest in time.
Optimal algorithms for smooth and strongly convex distributed optimization in networks
Kevin Scaman, Francis Bach, Sébastien Bubeck, Yin Tat Lee, and Laurent Massoulié · 2017
Closest in time.
Robust convergence analysis of distributed optimization algorithms
Akhil Sundararajan, Bin Hu, and Laurent Lessard · 2017
Closest in time.
Exact worst-case performance of first-order methods for composite convex optimization
Adrien B Taylor, Julien M Hendrickx, and François Glineur · 2017
Closest in time.
A dual approach for optimal algorithms in distributed optimization over networks
César A. Uribe, Soomin Lee, Alexander Gasnikov, and Angelia Nedić · 2018
Closest in time.