Pages that link to "Item:Q5347926"
From MaRDI portal
The following pages link to Gossip Algorithms for Convex Consensus Optimization Over Networks (Q5347926):
Displaying 22 items.
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems (Q286313) (← links)
- Inexact dual averaging method for distributed multi-agent optimization (Q460593) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Event-triggered zero-gradient-sum distributed consensus optimization over directed networks (Q905784) (← links)
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays (Q905789) (← links)
- A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems (Q1626951) (← links)
- Optimal distributed stochastic mirror descent for strongly convex optimization (Q1640744) (← links)
- Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients (Q1717855) (← links)
- Asynchronous gossip-based gradient-free method for multiagent optimization (Q1724545) (← links)
- Distributed stochastic gradient tracking methods (Q2020611) (← links)
- A new look at distributed optimal output agreement of multi-agent systems (Q2063820) (← links)
- Distributed cooperative learning over time-varying random networks using a gossip-based communication protocol (Q2219358) (← links)
- Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes (Q2235612) (← links)
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights (Q2293057) (← links)
- Convergence of random sleep algorithms for optimal consensus (Q2437791) (← links)
- Noise-to-state exponentially stable distributed convex optimization on weight-balanced digraphs (Q2796003) (← links)
- Almost sure exponential convergence to consensus of random gossip algorithms (Q2847260) (← links)
- A Generalized Gossip Algorithm on Convex Metric Spaces (Q2982730) (← links)
- Bounded Confidence Gossip Algorithms for Opinion Formation and Data Clustering (Q4629872) (← links)
- Event-triggered scheme for zero-gradient-sum optimisation under directed networks with time delay (Q5028019) (← links)
- Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms (Q5256808) (← links)
- A Fenchel dual gradient method enabling regularization for nonsmooth distributed optimization over time-varying networks (Q6113532) (← links)