Average-case optimization analysis for distributed consensus algorithms on regular graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3145563 (Why is no real title available?)
- scientific article; zbMATH DE number 5081744 (Why is no real title available?)
- scientific article; zbMATH DE number 5454133 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 911331 (Why is no real title available?)
- Accelerated gossip in networks of given dimension using Jacobi polynomial iterations
- Chebyshev acceleration of iterative refinement
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Halting time is predictable for large models: a universality property and average-case analysis
- Introductory lectures on convex optimization. A basic course.
- Lectures on convex optimization
- Methods of conjugate gradients for solving linear systems
- Min-max optimization over slowly time-varying graphs
- On the average number of steps of the simplex method of linear programming
- Polynomial based iteration methods for symmetric linear systems
- Quicksort
- Recent theoretical advances in decentralized distributed convex optimization
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Smoothed analysis of algorithms
- Some methods of speeding up the convergence of iteration methods
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- Spectral distributions of adjacency and Laplacian matrices of random graphs
This page was built for publication: Average-case optimization analysis for distributed consensus algorithms on regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986319)
