A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
From MaRDI portal
Publication:4622058
DOI10.1109/TSP.2016.2544743zbMath1414.94105arXiv1409.3307OpenAlexW2127883485MaRDI QIDQ4622058
Publication date: 8 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.3307
Decentralized systems (93A14) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (16)
A solution strategy for distributed uncertain economic dispatch problems via scenario theory ⋮ A distributed methodology for approximate uniform global minimum sharing ⋮ Tracking-ADMM for distributed constraint-coupled optimization ⋮ Supervised model predictive control of large‐scale electricity networks via clustering methods ⋮ Augmented Lagrangian tracking for distributed optimization with equality and inequality coupling constraints ⋮ Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks ⋮ Distributed safe resource allocation using barrier functions ⋮ Distributed nonconvex constrained optimization over time-varying digraphs ⋮ Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation ⋮ Distributed optimization under edge agreements: a continuous-time algorithm ⋮ Decentralized optimization with affine constraints over time-varying networks ⋮ Linear convergence of distributed estimation with constraints and communication delays ⋮ A review of decentralized optimization focused on information flows of decomposition algorithms ⋮ Distributed convex optimization with coupling constraints over time-varying directed graphs ⋮ A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks ⋮ A fully distributed ADMM-based dispatch approach for virtual power plant problems
This page was built for publication: A Proximal Dual Consensus ADMM Method for Multi-Agent Constrained Optimization
