Distributed Bregman-Distance Algorithms for Min-Max Optimization

DOI10.1007/978-3-642-34097-0_7zbMath1478.68390OpenAlexW132903907MaRDI QIDQ5023087

Angelia Nedić, Kunal Srivastava, Dušan M. Stipanović

Publication date: 20 January 2022

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.676.8020

zbMATH Keywords

stochastic approximationsubgradient methodstrong convexityexact penaltypower allocation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items

Distributed discrete‐time optimization algorithms with applications to resource allocation in epidemics control

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed stochastic subgradient projection algorithms for convex optimization
• Unifying view on min-max fairness, max-min fairness, and utility optimization in cellular networks
• Subgradient methods for saddle-point problems
• A new class of distributed optimization algorithms: application to regression of distributed data
• Convergence and asymptotic agreement in distributed decision problems
• A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
• Robust Stochastic Approximation Approach to Stochastic Programming
• stochastic quasigradient methods and their application to system optimization^†
• Necessary and sufficient conditions for a penalty method to be exact
• Gradient Convergence in Gradient methods with Errors
• Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise
• Distributed Subgradient Methods for Multi-Agent Optimization
• Constrained Consensus and Optimization in Multi-Agent Networks
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Decentralized Parameter Estimation by Consensus Based Stochastic Approximation
• Distributed Subgradient Methods for Convex Optimization Over Random Networks
• Asynchronous Broadcast-Based Convex Optimization Over a Network
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• Fully Distributed Algorithms for Convex Optimization Problems
• The elements of statistical learning. Data mining, inference, and prediction