Exploiting agent symmetries for performance analysis of distributed optimization methods

Cites work

A Decentralized Proximal-Gradient Method With Network Independent Step-Sizes and Separated Convergence Rates
A Proximal Gradient Algorithm for Decentralized Composite Optimization
Accelerated Distributed Nesterov Gradient Descent
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Analysis and Design of First-Order Distributed Optimization Algorithms Over Time-Varying Graphs
Analysis and design of optimization algorithms via integral quadratic constraints
Automatic Performance Estimation for Decentralized Optimization
Decentralized Accelerated Gradient Methods With Increasing Penalty Parameters
Distributed optimization and statistical learning via the alternating direction method of multipliers
Distributed Subgradient Methods for Multi-Agent Optimization
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
Exact worst-case performance of first-order methods for composite convex optimization
EXTRA: an exact first-order algorithm for decentralized consensus optimization
Fast linear iterations for distributed averaging
Generalized doubly stochastic matrices and linear preservers
On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
Optimal convergence rates for convex distributed optimization in networks
Optimal gradient tracking for decentralized optimization
Performance of first-order methods for smooth convex minimization: a novel approach
Revisiting EXTRA for Smooth Distributed Optimization
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Weighted ADMM for Fast Decentralized Network Optimization

This page was built for publication: Exploiting agent symmetries for performance analysis of distributed optimization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7288469)