Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
From MaRDI portal
(Redirected from Publication:5058405)
Recommendations
- A randomized incremental primal-dual method for decentralized consensus optimization
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Distributed zero-gradient-sum algorithm for convex optimization with time-varying communication delays and switching networks
- Distributed primal-dual stochastic subgradient algorithms for multi-agent optimization under inequality constraints
- Distributed delayed dual averaging for distributed optimization over time-varying digraphs
Cites work
- A class of randomized primal-dual algorithms for distributed optimization
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- Asynchronous Distributed ADMM for Large-Scale Optimization—Part I: Algorithm and<?Pub _newline ?>Convergence Analysis
- Asynchronous Multiagent Primal-Dual Optimization
- Asynchronous Optimization Over Graphs: Linear Convergence Under Error Bound Conditions
- Asynchronous parallel algorithms for nonconvex optimization
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- Convergence Rates in Forward--Backward Splitting
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed asynchronous incremental subgradient methods
- Distributed multi-agent optimization subject to nonidentical constraints and communication delays
- Distributed multi-agent optimization with state-dependent communication
- Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
- Distributed Subgradient Methods for Multi-Agent Optimization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3449561 (Why is no real title available?)
- scientific article; zbMATH DE number 7370577 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Incremental proximal methods for large scale convex optimization
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Quasi-Fejérian analysis of some optimization algorithms
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Subgradient methods for saddle-point problems
This page was built for publication: Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058405)
