Parallel alternating direction method of multipliers
From MaRDI portal
Publication:1999014
DOI10.1016/J.INS.2019.08.039zbMATH Open1456.90127OpenAlexW2968901045WikidataQ127366104 ScholiaQ127366104MaRDI QIDQ1999014FDOQ1999014
Authors: Jiaqi Yan, Fanghong Guo, Changyun Wen, Guoqi Li 
Publication date: 18 March 2021
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.08.039
Recommendations
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed inexact dual consensus ADMM for network resource allocation
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization
Convex programming (90C25) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Cites Work
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Title not available (Why is that?)
- Eigenvalues of the Laplacian of a graph∗
- Monotone Operators and the Proximal Point Algorithm
- Distributed Maximum Likelihood Sensor Network Localization
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Title not available (Why is that?)
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Distributed Subgradient Methods for Multi-Agent Optimization
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- Distributed average consensus with least-mean-square deviation
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Distributed Optimization Over Time-Varying Directed Graphs
- A distributed hierarchical algorithm for multi-cluster constrained optimization
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
Cited In (9)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Is ADMM always faster than average consensus?
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- Synchronous distributed ADMM for consensus convex optimization problems with self-loops
- Distributed cooperative optimization for multiple heterogeneous Euler-Lagrangian systems under global equality and inequality constraints
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- Parallel implicit methods of alternating directions
- Parallel alternating direction multiplier decomposition of convex programs
Uses Software
This page was built for publication: Parallel alternating direction method of multipliers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1999014)
