Communication-efficient algorithms for decentralized and stochastic optimization

This publication has 45 references indexed in Scilit:

• Distributed pursuit-evasion without mapping or global localization via local frontiers
  Autonomous Robots, 2011
• Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
  SIAM Journal on Optimization, 2011
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
  Foundations and Trends in Machine Learning, 2011
• Incremental proximal methods for large scale convex optimization
  Mathematical Programming, 2011
• Validation analysis of mirror descent stochastic approximation method
  Mathematical Programming, 2011
• An optimal method for stochastic composite optimization
  Mathematical Programming, 2011
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
  SIAM Journal on Optimization, 2010
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
  IEEE Transactions on Automatic Control, 2003
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
  IEEE Transactions on Automatic Control, 1986
• The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
  USSR Computational Mathematics and Mathematical Physics, 1967