Fetching the paper…
Reading the bibliography…
In this paper, we develop a class of decentralized algorithms for solving a convex resource allocation problem in a network of $n$ agents, where the agent objectives are decoupled while the resource constraints are coupled.
R. Rockafellar, Convex Analysis . Princeton University Press, 1970
1970
Earlier work this paper cites.
D. Bertsekas, A. Nedić, and A. Ozdaglar, Convex Analysis and Optimization . Athena Scientific Belmont, 2003
2003
Earlier work this paper cites.
L. Xiao, S. Boyd, and S. Lall, “Distributed Average Consensus with Time-Varying Metropolis Weights,” 2006, available online. [Online]. Available: http://www.stanford.edu/boyd/papers/avg_metropolis
2006
Earlier work this paper cites.
H. Lakshmanan and D. P. De Farias, “Decentralized Resource Allocation in Dynamic Networks of Agents,” SIAM Journal on Optimization , vol. 19, no. 2, pp. 911–940, 2008
2008
Earlier work this paper cites.
H. Seifi and M. Sepasian, Electric Power System Planning: Issues, Algorithms and Slutions . Springer Science & Business Media, 2011
2011
Earlier work this paper cites.
H. H. Bauschke and P. L. Combettes, Convex analysis and monotone operator theory in Hilbert spaces . Springer Science & Business Media, 2011
2011
Earlier work this paper cites.
S. Kar and G. Hug, “Distributed Robust Economic Dispatch in Power Systems: A Consensus + Innovations Approach,” in IEEE Power and Energy Society General Meeting , 2012, pp. 1–8
2012
Earlier work this paper cites.
I. Necoara, “Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization over Networks,” IEEE Transactions on Automatic Control , vol. 58, no. 8, pp. 2001–2012, 2013
2013
Earlier work this paper cites.
Y. Nesterov, Introductory lectures on convex optimization: A basic course . Springer Science & Business Media, 2013, vol. 87
2013
Earlier work this paper cites.
Y. Zhang and G. Giannakis, “Efficient Decentralized Economic Dispatch for Microgrids with Wind Power Integration,” in 6th Annual IEEE Green Technologies Conference (GreenTech) , 2014, pp. 7–12
2014
Earlier work this paper cites.
T. M. D. Tran and A. Y. Kibangou, “Distributed Estimation of Graph Laplacian Eigenvalues by the Alternating Direction of Multipliers Method,” IFAC Proceedings Volumes , vol. 47, no. 3, pp. 5526–5531, 2014
2014
Earlier work this paper cites.
T.-H. Chang, M. Hong, and X. Wang, “Multi-Agent Distributed Optimization via Inexact Consensus ADMM,” IEEE Transactions on Signal Processing , vol. 63, no. 2, pp. 482–497, 2015
2015
Earlier work this paper cites.
A. Nedić and A. Olshevsky, “Distributed Optimization over Time-Varying Directed Graphs,” IEEE Transactions on Automatic Control , vol. 60, no. 3, pp. 601–615, 2015
2015
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “A Proximal Gradient Algorithm for Decentralized Composite Optimization,” IEEE Transactions on Signal Processing , vol. 63, no. 22, pp. 6013–6023, 2015
2015
Cited alongside, same era.
L. Zhao, W.-Z. Song, and X. Ye, “Fast Dcentralized Gradient Descent Method and Applications to In-Situ Seismic Tomography,” in IEEE International Conference on Big Data (Big Data) , 2015, pp. 908–917
2015
Cited alongside, same era.
W. Shi, Q. Ling, G. Wu, and W. Yin, “EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization,” SIAM Journal on Optimization , vol. 25, no. 2, pp. 944–966, 2015
2015
Cited alongside, same era.
2016
Later among the works it cites.
2016
Later among the works it cites.
2016
Later among the works it cites.
H. Huang, Q. Ling, W. Shi, and J. Wang, “Collaborative Resource Allocation over a Hybrid Cloud Center and Edge Server Network,” Journal of Computational Mathematics , vol. 35, no. 4, pp. 421–436, 2017
2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Bubeck et al. , “Convex optimization: Algorithms and complexity,” Foundations and Trends® in Machine Learning , vol. 8, no. 3-4, pp. 231–357, 2015
2015
Cited alongside, same era.
F. Guo, C. Wen, J. Mao, and Y. Song, “Distributed Economic Dispatch for Smart Grids with Random Wind Power,” IEEE Transactions on Smart Grid , vol. 7, no. 3, pp. 1572–1583, 2016
2016
Cited alongside, same era.
2016
Cited alongside, same era.
2016
Cited alongside, same era.
A. Cherukuri and J. Cortés, “Initialization-free Distributed Coordination for Economic Dispatch under Varying Loads and Generator Commitment,” Automatica , vol. 74, pp. 183–193, 2016
2016
Cited alongside, same era.
T. Başar, S. R. Etesami, and A. Olshevsky, “Convergence Time of Quantized Metropolis Consensus over Time-Varying Networks,” IEEE Transactions on Automatic Control , vol. 61, no. 12, pp. 4048–4054, 2016
2016
Cited alongside, same era.
T. Wu, K. Yuan, Q. Ling, W. Yin, and A. H. Sayed, “Decentralized Consensus Optimization with Asynchrony and Delays,” in 50th Asilomar Conference on Signals, Systems and Computers , 2016, pp. 992–996
2016
Cited alongside, same era.
N. S. Aybat and E. Y. Hamedani, “Distributed primal-dual method for multi-agent sharing problem with conic constraints,” in Signals, Systems and Computers, 2016 50th Asilomar Conference on . IEEE, 2016, pp. 777–782
2016
Cited alongside, same era.
T. T. Doan and A. Olshevsky, “Distributed Resource Allocation on Dynamic Networks in Quadratic Time,” Systems & Control Letters , vol. 99, pp. 57–63, 2017
2017
Closest in time.
T. Yang, J. Lu, D. Wu, J. Wu, G. Shi, Z. Meng, and K. H. Johansson, “A Distributed Algorithm for Economic Dispatch over Time-Varying Directed Networks with Delays,” IEEE Transactions on Industrial Electronics , vol. 64, no. 6, pp. 5095–5106, 2017
2017
Closest in time.
2017
Closest in time.
J. Zeng and W. Yin, “ExtraPush for Convex Smooth Decentralized Optimization over Directed Networks,” Journal of Computational Mathematics , vol. 35, no. 4, pp. 381–394, 2017
2017
Closest in time.
C. Xi and U. Khan, “DEXTRA: A Fast Algorithm for Optimization over Directed Graphs,” IEEE Transactions on Automatic Control , vol. PP, no. 99, pp. 1–1, 2017
2017
Closest in time.
W. Deng, M. Lai, Z. Peng, and W. Yin, “Parallel Multi-Block ADMM with o ( 1 / k ) o(1/k) Convergence,” Journal of Scientific Computing , vol. 71, no. 2, pp. 712–736, 2017
2017
Closest in time.