A distributed augmented Lagrangian decomposition algorithm for constrained optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911191630086144 |
|---|---|
| author | Guo, Wenyou Qu, Ting Huang, Hainan Wei, Yafeng |
| author_facet | Guo, Wenyou Qu, Ting Huang, Hainan Wei, Yafeng |
| contents | Within the framework of the augmented Lagrangian (AL), we propose a novel distributed optimization method, termed Distributed Augmented Lagrangian Decomposition (DALD), and provide a rigorous convergence proof for its standard version. To address the high iteration costs in early stages, we propose several accelerated variants of DALD that enhances efficiency without compromising theoretical guarantees, supported by a comprehensive convergence analysis. To facilitate the description of the distributed optimization process, the concept of hierarchical coordination networks is introduced, integrating hierarchical matrix concepts to aid in this explanation. We further explore and expand the applicability of the DALD method and demonstrate how it unifies existing distributed optimization theories within the AL framework. The effectiveness and applicability of the proposed distributed optimization method and its variants are further validated through numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_04960 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A distributed augmented Lagrangian decomposition algorithm for constrained optimization Guo, Wenyou Qu, Ting Huang, Hainan Wei, Yafeng Optimization and Control Within the framework of the augmented Lagrangian (AL), we propose a novel distributed optimization method, termed Distributed Augmented Lagrangian Decomposition (DALD), and provide a rigorous convergence proof for its standard version. To address the high iteration costs in early stages, we propose several accelerated variants of DALD that enhances efficiency without compromising theoretical guarantees, supported by a comprehensive convergence analysis. To facilitate the description of the distributed optimization process, the concept of hierarchical coordination networks is introduced, integrating hierarchical matrix concepts to aid in this explanation. We further explore and expand the applicability of the DALD method and demonstrate how it unifies existing distributed optimization theories within the AL framework. The effectiveness and applicability of the proposed distributed optimization method and its variants are further validated through numerical experiments. |
| title | A distributed augmented Lagrangian decomposition algorithm for constrained optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2508.04960 |