Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 1793291, 13 pages
https://doi.org/10.1155/2017/1793291
Research Article

Distributed Constrained Stochastic Subgradient Algorithms Based on Random Projection and Asynchronous Broadcast over Networks

1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
2Information Engineering College, Henan University of Science and Technology, Luoyang, China

Correspondence should be addressed to Junlong Zhu; nc.ude.tpub@uhzlj

Received 22 February 2017; Accepted 17 July 2017; Published 28 September 2017

Academic Editor: Thomas Hanne

Copyright © 2017 Junlong Zhu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. V. Lesser, C. L. Ortiz, and M. Tambe, “Distributed sensor networks: introduction to a multiagent perspective,” in Distributed Sensor Networks, vol. 9 of Multiagent Systems, Artificial Societies, and Simulated Organizations, pp. 1–8, Springer US, Boston, MA, 2003. View at Publisher · View at Google Scholar
  2. M. Rabbat and R. Nowak, “Distributed optimization in sensor networks,” in Proceedings of the the third international symposium, pp. 20–27, Berkeley, California, CA, USA, 2004. View at Publisher · View at Google Scholar
  3. S. Kar and J. M. Moura, “Distributed consensus algorithms in sensor networks: quantized data and random link failures,” IEEE Transactions on Signal Processing, vol. 58, no. 3, part 1, pp. 1383–1400, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. S. Kar, J. M. Moura, and K. Ramanan, “Distributed parameter estimation in sensor networks: nonlinear observation models and imperfect communication,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 58, no. 6, pp. 3575–3605, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, Prediction, Springer-Verlag, New York, NY, USA, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  6. J. L. R. Bekkerman and M. Bilenko, Scaling up Machine Learning: Parallel and Distributed Approaches, Cambridge Univ. Press, Cambridge, U.K., 2011. View at Publisher · View at Google Scholar · View at Scopus
  7. R. L. Cavalcante, I. Yamada, and B. Mulgrew, “An adaptive projected subgradient approach to learning in diffusion networks,” IEEE Transactions on Signal Processing, vol. 57, no. 7, pp. 2762–2774, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. B. Johansson, On Distributed Optimization in Networked Systems [Ph.D. thesis], Royal Insitute of Technology, Stockholm, Sweden, 2008.
  9. A. Beck, A. Nedić, A. Ozdaglar, and M. Teboulle, “An O1/k gradient method for network resource allocation problems,” IEEE Transactions on Control of Network Systems, vol. 1, no. 1, pp. 64–73, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  10. T.-H. Chang, A. Nedić, and A. Scaglione, “Distributed constrained optimization by consensus-based primal-dual perturbation method,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 59, no. 6, pp. 1524–1538, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  11. Z. Jiang, S. Sarkar, and K. Mukherjee, “On distributed optimization using generalized gossip,” in Proceedings of the 54th IEEE Conference on Decision and Control, CDC 2015, pp. 2667–2672, Japan, 2015. View at Publisher · View at Google Scholar · View at Scopus
  12. A. Nedić and A. Olshevsky, “Distributed optimization over time-varying directed graphs,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 60, no. 3, pp. 601–615, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  13. A. Makhdoumi and A. Ozdaglar, “Graph balancing for distributed subgradient methods over directed graphs,” in Proceedings of the 54th IEEE Conference on Decision and Control, CDC 2015, pp. 1364–1371, Japan, 2015. View at Publisher · View at Google Scholar · View at Scopus
  14. D. Varagnolo, F. Zanella, A. Cenedese, G. Pillonetto, and L. Schenato, “Newton-Raphson consensus for distributed convex optimization,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 61, no. 4, pp. 994–1009, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. A. Nedić and A. Olshevsky, “Stochastic gradient-push for strongly convex functions on time-varying directed graphs,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 61, no. 12, pp. 3936–3947, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  16. A. Nedić, A. Ozdaglar, and A. Parrilo, “Constrained consensus and optimization in multi-agent networks,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 55, no. 4, pp. 922–938, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  17. K. Srivastava and A. Nedić, “Distributed asynchronous constrained stochastic optimization,” IEEE Journal on Selected Topics in Signal Processing, vol. 5, no. 4, pp. 772–790, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. I. Lobel, A. Ozdaglar, and D. Feijer, “Distributed multi-agent optimization with state-dependent communication,” Mathematical Programming, vol. 129, no. 2, Ser. B, pp. 255–284, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. A. Nedić, “Random algorithms for convex minimization problems,” Mathematical Programming, vol. 129, no. 2, Ser. B, pp. 225–253, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  20. S. Lee and A. Nedić, “Distributed random projection algorithm for convex optimization,” IEEE Journal on Selected Topics in Signal Processing, vol. 7, no. 2, pp. 221–229, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, “Randomized gossip algorithms,” Institute of Electrical and Electronics Engineers. Transactions on Information Theory, vol. 52, no. 6, pp. 2508–2530, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. T. C. Aysal, M. E. Yildiz, A. Sarwate, and A. Scaglione, “Broadcast gossip algorithms for consensus,” IEEE Transactions on Signal Processing, vol. 57, no. 7, pp. 2748–2761, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  23. S. Lee and A. Nedić, “Asynchronous gossip-based random projection algorithms over networks,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 61, no. 4, pp. 953–968, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  24. F. Fagnani and S. Zampieri, “Randomized consensus algorithms over large scale networks,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 4, pp. 634–649, 2008. View at Publisher · View at Google Scholar · View at Scopus
  25. Y. Yang and R. S. Blum, “Broadcast-based consensus with non-zero-mean stochastic perturbations,” IEEE Transactions on Information Theory, vol. 59, no. 6, pp. 3971–3989, 2013. View at Publisher · View at Google Scholar · View at Scopus
  26. A. Nedić, “Asynchronous broadcast-based convex optimization over a network,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 56, no. 6, pp. 1337–1351, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  27. L. Gubin, B. Polyak, and E. Raik, “The method of projections for finding the common point of convex sets,” USSR Computational Mathematics and Mathematical Physics, vol. 7, no. 6, pp. 1211–1228, 1967. View at Publisher · View at Google Scholar · View at Scopus
  28. D. Bertsekas, A. Nedić, and A. Ozdaglar, Convex Analysis and Optimization, Athena Scientific, Belmont, Mass, MA, USA, 2003. View at MathSciNet
  29. B. T. Polyak, Introduction to Optimization, Optimization Software, New York, NY, USA, 1987. View at MathSciNet
  30. H. Royden, Real Analysis, Prentice Hall, Englewood Cliffs, NJ, USA, 3rd edition, 1998.