Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients

DOI10.1155/2014/202737zbMath1407.90328OpenAlexW2069252942WikidataQ59063742 ScholiaQ59063742MaRDI QIDQ1717855

Yang Yang, Deming Yuan

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/202737

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Minimax problems in mathematical programming (90C47) Communication networks in operations research (90B18) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• Distributed discrete-time coordinated tracking with Markovian switching topologies
• Distributed dual averaging method for multi-agent optimization with quantized communication
• Subgradient methods for saddle-point problems
• Fast linear iterations for distributed averaging
• Distributed Subgradient Methods for Multi-Agent Optimization
• Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus seeking in multiagent systems under dynamically changing interaction topologies
• Gossip Algorithms for Convex Consensus Optimization Over Networks
• On Distributed Convex Optimization Under Inequality and Equality Constraints
• Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
• Distributed Containment Control with Multiple Dynamic Leaders for Double-Integrator Dynamics Using Only Position Measurements

This page was built for publication: Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients