Pages that link to "Item:Q1749336"
From MaRDI portal
The following pages link to Convergence rates of discrete-time stochastic approximation consensus algorithms: graph-related limit bounds (Q1749336):
Displaying 8 items.
- Tight estimates for convergence of some non-stationary consensus algorithms (Q953469) (← links)
- Convergence and error estimates for time-discrete consensus-based optimization algorithms (Q1996226) (← links)
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization (Q2154832) (← links)
- Geometric bounds for convergence rates of averaging algorithms (Q2672273) (← links)
- Almost sure exponential convergence to consensus of random gossip algorithms (Q2847260) (← links)
- An Upper Bound on the Convergence Time for Quantized Consensus of Arbitrary Static Graphs (Q2982792) (← links)
- Convergence Speed of Unsteady Distributed Consensus: Decay Estimate Along the Settling Spanning-Trees (Q5190241) (← links)
- Discrete-time stochastic consensus: a Kalman-filter-based two-time-scale protocol (Q6161348) (← links)
