Anderson Acceleration for Distributed Constrained Optimization over Time-varying Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917209396215808 |
|---|---|
| author | Liu, Haijuan Wu, Xuyang |
| author_facet | Liu, Haijuan Wu, Xuyang |
| contents | This paper applies the Anderson Acceleration (AA) technique to accelerate the Fenchel dual gradient method (FDGM) to solve constrained optimization problems over time-varying networks. AA is originally designed for accelerating fixed-point iterations, and its direct application to FDGM faces two challenges: 1) FDGM in time-varying networks cannot be formulated as a standard fixed-point update; 2) even if the network is fixed so that FDGM can be expressed as a fixed-point iteration, the direct application of AA is not distributively implementable. To overcome these challenges, we first rewrite each update of FDGM as inexactly solving several \emph{local} problems where each local problem involves two neighboring nodes only, and then incorporate AA to solve each local problem with higher accuracy, resulting in the Fenchel Dual Gradient Method with Anderson Acceleration (FDGM-AA). To guarantee global convergence of FDGM-AA, we equip it with a newly designed safe-guard scheme. Under mild conditions, our algorithm converges at a rate of \(O(1/\sqrt{k})\) for the primal sequence and \(O(1/k)\) for the dual sequence. The competitive performance of our algorithm is validated through numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_12398 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Anderson Acceleration for Distributed Constrained Optimization over Time-varying Networks Liu, Haijuan Wu, Xuyang Optimization and Control This paper applies the Anderson Acceleration (AA) technique to accelerate the Fenchel dual gradient method (FDGM) to solve constrained optimization problems over time-varying networks. AA is originally designed for accelerating fixed-point iterations, and its direct application to FDGM faces two challenges: 1) FDGM in time-varying networks cannot be formulated as a standard fixed-point update; 2) even if the network is fixed so that FDGM can be expressed as a fixed-point iteration, the direct application of AA is not distributively implementable. To overcome these challenges, we first rewrite each update of FDGM as inexactly solving several \emph{local} problems where each local problem involves two neighboring nodes only, and then incorporate AA to solve each local problem with higher accuracy, resulting in the Fenchel Dual Gradient Method with Anderson Acceleration (FDGM-AA). To guarantee global convergence of FDGM-AA, we equip it with a newly designed safe-guard scheme. Under mild conditions, our algorithm converges at a rate of \(O(1/\sqrt{k})\) for the primal sequence and \(O(1/k)\) for the dual sequence. The competitive performance of our algorithm is validated through numerical experiments. |
| title | Anderson Acceleration for Distributed Constrained Optimization over Time-varying Networks |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2601.12398 |