NPGA: A Unified Algorithmic Framework for Decentralized Constraint-Coupled Optimization
arXiv:2205.11119 · doi:10.1109/TCNS.2024.3354882
Abstract
This work focuses on a class of general decentralized constraint-coupled optimization problems. We propose a novel nested primal-dual gradient algorithm (NPGA), which can achieve linear convergence under the weakest known condition, and its theoretical convergence rate surpasses all known results. More importantly, NPGA serves not only as an algorithm but also as a unified algorithmic framework, encompassing various existing algorithms as special cases. By designing different network matrices, we can derive numerous versions of NPGA and analyze their convergences by leveraging the convergence results of NPGA conveniently, thereby enabling the design of more efficient algorithms. Finally, we conduct numerical experiments to compare the convergence rates of NPGA and existing algorithms, providing empirical evidence for the superior performance of NPGA.
References in corpus (10)
- Harnessing Smoothness to Accelerate Distributed Optimization
- Initialization-free Distributed Algorithms for Optimal Resource Allocation with Feasibility Constraints and its Application to Economic Dispatch of Power Systems
- Multi-Agent Distributed Optimization via Inexact Consensus ADMM
- A decentralized proximal-gradient method with network independent step-sizes and separated convergence rates
- Distributed Basis Pursuit
- Distributed Algorithms for Composite Optimization: Unified Framework and Convergence Analysis
- A Linearly Convergent Proximal Gradient Algorithm for Decentralized Optimization
- Implicit Tracking-Based Distributed Constraint-Coupled Optimization
- Gradient Tracking: A Unified Approach to Smooth Distributed Optimization
- NPGA: A Unified Algorithmic Framework for Decentralized Constraint-Coupled Optimization