Parallel alternating direction method of multipliers
From MaRDI portal
Publication:1999014
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
Cites work
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems
- A distributed hierarchical algorithm for multi-cluster constrained optimization
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Convergence of Asynchronous Distributed Gradient Methods Over Stochastic Networks
- D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
- Decomposition method with a variable parameter for a class of monotone variational inequality problems
- Distributed Maximum Likelihood Sensor Network Localization
- Distributed Optimization Over Time-Varying Directed Graphs
- Distributed Subgradient Methods for Multi-Agent Optimization
- Distributed average consensus with least-mean-square deviation
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Distributed optimization for multi-agent systems with constraints set and communication time-delay over a directed graph
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Eigenvalues of the Laplacian of a graph∗
- Monotone Operators and the Proximal Point Algorithm
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
- Parallel multi-block ADMM with \(o(1/k)\) convergence
Cited in
(16)- Fast and stable nonconvex constrained distributed optimization: the ELLADA algorithm
- Hybrid MPI/OpenMP parallel asynchronous distributed alternating direction method of multipliers
- A consensus-based alternating direction method of multipliers approach to parallelize large-scale minimum-lap-time problems
- Distributed inexact dual consensus ADMM for network resource allocation
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- 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 implicit methods of alternating directions
- Parallel alternating direction multiplier decomposition of convex programs
- Distributed optimal consensus of multi-agent systems: a randomized parallel approach
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
- Distributed convex optimization based on ADMM and belief propagation methods
- Is ADMM always faster than average consensus?
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- An accelerated proximal alternating direction method of multipliers for optimal decentralized control of uncertain systems
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)
