Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
From MaRDI portal
Publication:5409133
DOI10.1002/RNC.2856zbMATH Open1285.93105OpenAlexW1963021298MaRDI QIDQ5409133FDOQ5409133
Authors: Deming Yuan, Shengyuan Xu, Baoyong Zhang, Lina Rong 
Publication date: 14 April 2014
Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rnc.2856
Recommendations
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Stochastic mirror descent method for distributed multi-agent optimization
- Inexact dual averaging method for distributed multi-agent optimization
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
convex optimizationmulti-agent systemssubgradient methodsdistributed average consensusgossip algorithms
Cites Work
- Subgradient methods for saddle-point problems
- Fast linear iterations for distributed averaging
- Constrained Consensus and Optimization in Multi-Agent Networks
- 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
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Distributed average consensus via gossip algorithm with real-valued and quantized data for \(0<q<1\)
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed multi-vehicle coordinated control via local information exchange
- On Distributed Convex Optimization Under Inequality and Equality Constraints
- Consensus control for a class of networks of dynamic agents
- Title not available (Why is that?)
- Distributed stochastic subgradient projection algorithms for convex optimization
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Communication constraints in the average consensus problem
- Gossip consensus algorithms via quantized communication
Cited In (23)
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- Asynchronous gossip-based gradient-free method for multiagent optimization
- NNs-based event-triggered consensus control of a class of uncertain nonlinear multi-agent systems
- Distributed primal-dual method on unbalanced digraphs with row stochasticity
- Distributed heterogeneous multi-agent optimization with stochastic sub-gradient
- Distributed stochastic subgradient projection algorithms for convex optimization
- Event-triggered zero-gradient-sum distributed consensus optimization over directed networks
- Multiuser optimization: distributed algorithms and error analysis
- Distributed proximal-gradient method for convex optimization with inequality constraints
- Asymptotic properties of primal-dual algorithm for distributed stochastic optimization over random networks with imperfect communications
- Distributed hybrid impulsive algorithm with supervisory resetting for nonlinear optimization problems
- Inexact dual averaging method for distributed multi-agent optimization
- Subgradient averaging for multi-agent optimisation with different constraint sets
- Distributed Proximal Algorithms for Multiagent Optimization With Coupled Inequality Constraints
- Stochastic mirror descent method for distributed multi-agent optimization
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints
- Stable Convergence of a Primal-Dual Method for Multi-agent Optimization Problems
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
- Primal-dual \(\varepsilon\)-subgradient method for distributed optimization
- A new protocol for finite-time consensus of detail-balanced multi-agent networks
- Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients
This page was built for publication: Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409133)
