Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
From MaRDI portal
Publication:5058405
DOI10.1080/10556788.2021.2023524OpenAlexW3015546775MaRDI QIDQ5058405
Panagiotis Patrinos, Puya Latafat
Publication date: 20 December 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.07199
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Distributed multi-agent optimization with state-dependent communication
- Incremental proximal methods for large scale convex optimization
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Subgradient methods for saddle-point problems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Asynchronous parallel algorithms for nonconvex optimization
- A Class of Randomized Primal-Dual Algorithms for Distributed Optimization
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Convergence Rates in Forward--Backward Splitting
- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
- Asynchronous Multiagent Primal-Dual Optimization
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- Distributed Subgradient Methods for Multi-Agent Optimization
- Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions
- A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays