Almost sure convergence of distributed optimization with imperfect information sharing

DOI10.1016/J.AUTOMATICA.2025.112391MaRDI QIDQ6947642zbMATH OpenFDO

Authors Anand Gokhale, Behrouz Touri, S. Mohajer

Publication date 5 August 2025

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2025.112391

zbMATH Keywords

almost sure convergenceconvex optimizationdistributed multi-agent systemdistributed optimizationgradient descenttime-varying graphs

Mathematics Subject Classification ID

Convex programming (90C25) Multi-agent systems (93A16) Networked control (93B70) Time-scale analysis and singular perturbations in control/observation systems (93C70)

Cites work

• Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
• Constrained Consensus and Optimization in Multi-Agent Networks
• Convergence Rates of Distributed Gradient Methods Under Random Quantization: A Stochastic Approximation Approach
• Decentralized Optimization Over Time-Varying Directed Graphs With Row and Column-Stochastic Matrices
• DIMIX: Diminishing Mixing for Sloppy Agents
• Distributed Optimization Over Dependent Random Networks
• Distributed Optimization Over Time-Varying Directed Graphs
• Distributed Optimization Over Time-Varying Graphs With Imperfect Sharing of Information
• Distributed Subgradient Methods for Multi-Agent Optimization
• Harnessing Smoothness to Accelerate Distributed Optimization
• scientific article; zbMATH DE number 3449561 (Why is no real title available?)
• Non-Convex Distributed Optimization

This page was built for publication: Almost sure convergence of distributed optimization with imperfect information sharing

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