287
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

Generalised gossip-based subgradient method for distributed optimisation

ORCID Icon, & ORCID Icon
Pages 1209-1225 | Received 23 Nov 2016, Accepted 26 Sep 2017, Published online: 14 Nov 2017

References

  • Altman, E. , Avrachenkov, K. , Miller, G. , & Prabhu, B . (2007). Discrete power control: Cooperative and non-cooperative optimization. In Infocom 2007. 26th IEEE international conference on computer communications (pp. 37–45). Barcelona, Spain: IEEE.
  • Arora, S. , & Nabieva, E. (2002). Markov chains and random walks. Princeton University.
  • Atzeni, I. , Ordonez, L. , Scutari, G. , Palomar, D. , & Fonollosa, J . (2013). Noncooperative and cooperative optimization of distributed energy generation and storage in the demand-side of the smart grid. IEEE Transactions on Signal Processing, 61 (10), 2454–2472.
  • Borkar, V. , & Varaiya, P . (1982). Asymptotic agreement in distributed estimation. IEEE Transactions on Automatic Control, 27 , 650–655.
  • Boyd, S. , Ghosh, A. , Prabhakar, B. , & Shah, D . (2006). Randomized gossip algorithms. IEEE/ACM Transactions on Networking, 14 , 2508–2530.
  • Boyd, S. , Xiao, L. , & Mutapcic, A. (2003). Subgradient methods.Stanford University.
  • Cavalcante, R. L. G. , & Stanczak, S . (2013). A distributed subgradient method for dynamic convex optimization problems under noisy information exchange. IEEE Journal of Selected Topics in Signal Processing, 7 (2), 243–256.
  • Chattopadhyay, P. , Jha, D. K. , Sarkar, S. , & Ray, A . (2015). Path planning in GPS-denied environments: A collective intelligence approach. Proceedings of American control conference . Chicago, IL, USA.
  • Dimakis, A. G. , Kar, S. , Moura, J. M. , Rabbat, M. G. , & Scaglione, A . (2010). Gossip algorithms for distributed signal processing. Proceedings of the IEEE, 98 (11), 1847–1864.
  • Franceschelli, M. , Giua, A. , & Seatzu, C. (2010). A gossip-based algorithm for discrete consensus over heterogeneous networks. IEEE Transactions on Automatic Control, 55 (5), 1244–1249.
  • Jadbabaie, A. , Lin, J. , & Morse, A. S . (2006). Coordination of groups of mobile autonomous agents using nearest neighbor. IEEE Transactions on Automatic Control, 48, 988–1001.
  • Jiang, Z. , Sarkar, S. , & Mukherjee, K . (2015). On distributed optimization using generalized gossip. Proceedings of 54th IEEE conference on decision and control , Osaka, Japan.
  • Johansson, B. , Keviczky, T. , Johansson, M. , & Johansson, K. H . (2008). Subgradient methods and consensus algorithms for solving convex optimization problems. In Proceedings of the 47th IEEE conference on decision and control , (pp. 4185–4190). Caucun, Mexico: IEEE.
  • Kar, S. , & Moura, J. M. F . (2009). Distributed consensus algorithms in sensor networks with imperfect communication: Link failures and channel noise. IEEE Transactions on Signal Processing, 57 (1), 355–369.
  • Khuller, S. , Kim, Y.-A. , & Wan, Y.-C. (2003). On generalized gossiping and broadcasting. In G. Di Battista & U. Zwick (Eds.), Algorithms - ESA 2003 (Vol. 2832, pp. 373–384). Berlin: Springer.
  • Kiwiel, K. C . (2004). Convergence of approximate and incremental subgradient methods for convex optimization. SIAM Journal on Optimization, 14 , 807–840.
  • Long, Q. , Wu, C. , & Wang, X . (2015). A system of nonsmooth equations solver based upon subgradient method. Applied Mathematics and Computation, 251, 284–299.
  • Lu, J. , Tang, C. Y. , Regier, P. R. , & Bow, T. D . (2010). A gossip algorithm for convex consensus optimization over networks. In Proceedings of American control conference , (pp. 301–308). Baltimore, MD: IEEE.
  • Ma, Y. , Anderson, G. , & Borrelli, F . (2011). A distributed predictive control approach to building temperature regulation. Proceedings of 2011 American control conference , San Francisco, CA.
  • Matei, I. , Somarakis, C. , & Baras, J. S . (2014). A generalized gossip algorithm on convex metric spaces. IEEE Transactions on Automatic Control . 60, 1175–1187.
  • Nedic, A. , & Bertsekas, D. P . (2001). Incremental subgradient methods for nondifferentiable optimization. SIAM Journal on Optimization, 12 (1), 109–138.
  • Nedic, A. , & Bertsekas, D . (2008). The effect of deterministic noise in subgradient methods. Mathematical Programming Series B . 125, 75–99.
  • Nedic, A. , & Lee, S . (2014). On stochastic subgradient mirror-descent algorithm with weighted averaging. SIAM Journal on Optimization, 24 (1), 84–107.
  • Nedic, A. , & Olshevsky, A . (2015). Distributed optimization over time-varying directed graphs. IEEE Transactions on Automatic Control, 60 , 601–615.
  • Nedic, A. , & Ozdaglar, A . (2008). Subgradient methods in network resource allocation: Rate analysis. Proceedings of 42nd annual conference on information sciences and systems , Princeton, NJ.
  • Nedic, A. , & Ozdaglar, A . (2009). Distributed subgradient methods for multi-agent optimization. IEEE Transactions on Automatic Control, 54 , 48–61.
  • Patterson, S. , Bamieh, B. , & El Abbadi, A . (2010). Convergence rates of distributed average consensus with stochastic link failures. IEEE Transactions on Automatic Control, 55 (4), 880–892.
  • Ram, S. S. , Nedic, A. , & Veeravalli, V. V . (2009). Asynchronous gossip algorithms for stochastic optimization. Proceedings of joint 48th IEEE conference on decision and control and 28th Chinese control conference , Shanghai, China.
  • Ram, S. S. , Nedich, A. , & Veeravalli, V. V . (2008). Distributed stochastic subgradient projection algorithms for convex optimization. arXiv:0811.2595v1[math.OC] .
  • Saber, R. O. , Fax, J. A. , & Murray, R. M . (2007). Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 95 , 215–233.
  • Salehi Tahbaz, A. , & Jadbabaie, A . (2010). Consensus over ergodic stationary graph processes. IEEE Transactions on Automatic Control, 55 , 225–230.
  • Sarkar, S. , & Mukherjee, K . (2014). Event-triggered decision propagation in proximity networks. Frontiers in Robotics and AI, 1 , 15.
  • Sarkar, S. , Mukherjee, K. , & Ray, A . (2013). Distributed decision propagation in mobile-agent proximity networks. International Journal of Control, 86 (6), 1118–1130.
  • Sarkar, S. , Mukherjee, K. , Srivastav, A. , & Ray, A . (2010). Distributed decision propagation in mobile agent networks. Proceedings of conference on decision and control , Atlanta, GA.
  • Shah, D . (2008). Gossip algorithms. Foundations and Trends in Networking, 3 , 1–125.
  • Spielman, D. A . (2009). Spectral graph theory-the laplacian. Lecture 2 .
  • Srivastava, K. , & Nedic, A . (2011). Distributed asynchronous constrained stochastic optimization. IEEE Journal of Selected Topics in Signal Processing, 5 (4), 772–790.
  • Srivastava, K. , Nedic, A. , & Stipanovic, D. M . (2010). Distributed constrained optimization over noisy networks. In Proceedings of CDC, 2010 49th IEEE conference on CDC , (pp. 1945–1950). Atlanta, GA: IEEE.
  • Touri, B. , & Nedic, A . (2009). Distributed consensus over network with noisy links. In Proceedings of 12th international conference on information fusion , (pp. 146–154). Seattle, WA: IEEE.
  • Tsitsiklis, J. , Bertsekas, D. , & Athans, M . (1986). Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Transactions on Automatic Control, 31 , 803–812.
  • Xiao, L. , & Boyd, S. (2004). Fast linear iterations for distributed averaging. Systems & Control Letters, 53 (1), 65–78.
  • Yuan, D. , Xu, S. , & Zhao, H. (2011). Distributed primal-dual subgradient method for multiagent optimization via consensus algorithm. IEEE Transactions on Systems, Man, and Cybernetics, 41 , 1715–1724.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.