Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
From MaRDI portal
(Redirected from Publication:5256808)
Recommendations
- Gradient-free push-sum method for strongly convex distributed optimization
- Randomized Gradient-Free Distributed Optimization Methods for a Multiagent System With Unknown Cost Function
- Distributed Subgradient Methods for Multi-Agent Optimization
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- A local-minimization-free zero-gradient-sum algorithm for distributed optimization
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- Gradient-free distributed optimization with exact convergence
- Gradient-free method for nonsmooth distributed optimization
- Distributed multi-step subgradient optimization for multi-agent system
- Asynchronous gossip-based gradient-free method for multiagent optimization
Cites work
- Asynchronous Broadcast-Based Convex Optimization Over a Network
- Consensus in multi-agent systems with communication constraints
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Distributed observers design for leader-following control of multi-agent networks
- Distributed stochastic subgradient projection algorithms for convex optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Fast linear iterations for distributed averaging
- Gossip Algorithms for Convex Consensus Optimization Over Networks
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- Impulsive consensus of multi-agent directed networks with nonlinear perturbations
- Introduction to Derivative-Free Optimization
- Multi-vehicle coordination for double-integrator dynamics under fixed undirected/directed interaction in a sampled-data setting
- On Distributed Convex Optimization Under Inequality and Equality Constraints
Cited in
(30)- Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients
- Asynchronous gossip-based gradient-free method for multiagent optimization
- Distributed consensus-based multi-agent convex optimization via gradient tracking technique
- Distributed stochastic gradient tracking methods
- A study on distributed optimization over large-scale networked systems
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
- Gradient-free distributed optimization with exact convergence
- Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging
- Convergence of distributed gradient-tracking-based optimization algorithms with random graphs
- An improved distributed gradient-push algorithm for bandwidth resource allocation over wireless local area network
- Exact spectral-like gradient method for distributed optimization
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- Incremental gradient-free method for nonsmooth distributed optimization
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- Distributed Nonconvex Optimization of Multiagent Systems Using Boosting Functions to Escape Local Optima
- Gradient-free push-sum method for strongly convex distributed optimization
- Strong consistency of random gradient-free algorithms for distributed optimization
- Push–Pull Gradient Methods for Distributed Optimization in Networks
- A gradient‐free distributed optimization method for convex sum of nonconvex cost functions
- Optimal consensus for uncertain high‐order multi‐agent systems by output feedback
- Differentially private distributed online learning over time‐varying digraphs via dual averaging
- Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks
- Resilient consensus‐based distributed optimization under deception attacks
- Distributed continuous‐time constrained convex optimization with general time‐varying cost functions
- Federated learning for minimizing nonsmooth convex loss functions
- Nabla fractional distributed optimization algorithms over undirected/directed graphs
- Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
- On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
- Distributed coordination for a class of non-linear multi-agent systems with regulation constraints
- An improved convergence guarantee for the gradient-push algorithm with a constant stepsize
This page was built for publication: Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256808)
