Distributed Bregman-Distance Algorithms for Min-Max Optimization

This publication has 27 references indexed in Scilit:

• Distributed Subgradient Methods for Convex Optimization Over Random Networks
  IEEE Transactions on Automatic Control, 2010
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
  SIAM Journal on Optimization, 2010
• Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise
  IEEE Transactions on Signal Processing, 2008
• Power Control in Wireless Cellular Networks
  Foundations and Trends® in Networking, 2008
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
  IEEE Transactions on Automatic Control, 2003
• Gradient Convergence in Gradient methods with Errors
  SIAM Journal on Optimization, 2000
• Numerical Techniques for Stochastic Optimization
  1988
• stochastic quasigradient methods and their application to system optimization^†
  Stochastics, 1983
• Necessary and sufficient conditions for a penalty method to be exact
  Mathematical Programming, 1975
• 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