Adaptive consensus: a network pruning approach for decentralized optimization

DOI10.1137/23M1599379MaRDI QIDQ6644846zbMATH OpenFDO

Authors Suhail M. Shah, Albert S. Berahas, Raghu Bollapragada

Publication date 28 November 2024

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/23M1599379

zbMATH Keywords

adaptive consensusdecentralized optimizationgradient tracking methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Convex programming (90C25) Nonlinear programming (90C30) Programming involving graphs or networks (90C35)

Cites work

• A Collaborative Training Algorithm for Distributed Learning
• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• An Exact Quantized Decentralized Gradient Descent Algorithm
• Asynchronous Gradient Push
• Average Consensus in the Presence of Delays in Directed Graph Topologies
• Balancing Communication and Computation in Distributed Optimization
• Coefficients of ergodicity: structure and applications
• Communication-efficient algorithms for decentralized and stochastic optimization
• Communication-efficient distributed optimization of self-concordant empirical loss
• Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
• Convergence speed in distributed consensus and averaging
• CVXPY: a Python-embedded modeling language for convex optimization
• Distributed asynchronous deterministic and stochastic gradient optimization algorithms
• EXTRA: an exact first-order algorithm for decentralized consensus optimization
• Greedy Gossip With Eavesdropping
• scientific article; zbMATH DE number 3135399 (Why is no real title available?)
• scientific article; zbMATH DE number 6508162 (Why is no real title available?)
• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• On Distributed Averaging Algorithms and Quantization Effects
• On the Convergence of Nested Decentralized Gradient Methods With Multiple Consensus and Gradient Steps
• Parallel coordinate descent methods for big data optimization
• Products of Indecomposable, Aperiodic, Stochastic Matrices
• Push–Pull Gradient Methods for Distributed Optimization in Networks
• Randomly Generated Test Problems for Positive Definite Quadratic Programming
• The Braess paradox

Cited in

(1)

• A flexible gradient tracking algorithmic framework for decentralized optimization

This page was built for publication: Adaptive consensus: a network pruning approach for decentralized optimization

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