D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
From MaRDI portal
(Redirected from Publication:4578552)
Abstract: We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observed even when these conditions are not met. We use D-ADMM to solve the following problems from signal processing and control: average consensus, compressed sensing, and support vector machines. Our simulations show that D-ADMM requires less communications than state-of-the-art algorithms to achieve a given accuracy level. Algorithms with low communication requirements are important, for example, in sensor networks, where sensors are typically battery-operated and communicating is the most energy consuming operation.
Cited in
(46)- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
- A general solution to least squares problems with box constraints and its applications
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Parallel alternating direction method of multipliers
- ADMM-EM method for \(L_1\)-norm regularized weighted least squares PET reconstruction
- Distributed decision-coupled constrained optimization via proximal-tracking
- Robust distributed model predictive control of linear systems: analysis and synthesis
- Subgroup-effects models for the analysis of personal treatment effects
- A novel bound on the convergence rate of ADMM for distributed optimization
- Tracking-ADMM for distributed constraint-coupled optimization
- Partition-based multi-agent optimization in the presence of lossy and asynchronous communication
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks
- Primal-dual stochastic distributed algorithm for constrained convex optimization
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
- Distributed Model Predictive Control of linear discrete-time systems with local and global constraints
- A framework for parallel second order incremental optimization algorithms for solving partially separable problems
- Employing different loss functions for the classification of images via supervised learning
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs
- A distributed methodology for approximate uniform global minimum sharing
- Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm
- Book review of: W. C. Stirling, Theory of conditional games
- Automatic Response Category Combination in Multinomial Logistic Regression
- D-ADMM
- scientific article; zbMATH DE number 6982986 (Why is no real title available?)
- Distributed stochastic variance reduced gradient methods by sampling extra data with replacement
- A randomized incremental primal-dual method for decentralized consensus optimization
- On the convergence of exact distributed generalisation and acceleration algorithm for convex optimisation
- scientific article; zbMATH DE number 7626711 (Why is no real title available?)
- scientific article; zbMATH DE number 7164723 (Why is no real title available?)
- ADD-OPT: Accelerated Distributed Directed Optimization
- ADMM for Penalized Quantile Regression in Big Data
- Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints
- S-NEAR-DGD: A Flexible Distributed Stochastic Gradient Method for Inexact Communication
- Linear convergence of distributed estimation with constraints and communication delays
- A review of decentralized optimization focused on information flows of decomposition algorithms
- Communication-efficient distributed statistical inference on zero-inflated Poisson models
- A generalized alternating direction implicit method for consensus optimization: application to distributed sparse logistic regression
- Deep image prior and weighted anisotropic-isotropic total variation regularization for solving linear inverse problems
- Advanced reference-constrained image restoration algorithm
- Byzantine-robust distributed support vector machine
- Convergence of an accelerated distributed optimisation algorithm over time-varying directed networks
- Evolutionary-games approach for distributed predictive control involving resource allocation
- Relaxed hybrid consensus ADMM for distributed convex optimisation with coupling constraints
This page was built for publication: D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4578552)
