The paper proposes Consensus ALADIN (C-ALADIN) algorithms that solve distributed consensus optimization with global convergence for convex problems and local convergence for non-convex ones, including a decentralized version over directed graphs using quantized communication.
Numerical analysis (nineth ed ition),
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Distributed and Decentralized Optimization Algorithms via Consensus ALADIN
The paper proposes Consensus ALADIN (C-ALADIN) algorithms that solve distributed consensus optimization with global convergence for convex problems and local convergence for non-convex ones, including a decentralized version over directed graphs using quantized communication.