A distributed proximal splitting method with linesearch for locally Lipschitz gradients
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910939762130944 |
|---|---|
| author | Atenas, Felipe Dao, Minh N. Tam, Matthew K. |
| author_facet | Atenas, Felipe Dao, Minh N. Tam, Matthew K. |
| contents | In this paper, we propose a distributed first-order algorithm with backtracking linesearch for solving multi-agent minimisation problems, where each agent handles a local objective involving nonsmooth and smooth components. Unlike existing methods that require global Lipschitz continuity and predefined stepsizes, our algorithm adjusts stepsizes using distributed linesearch procedures, making it suitable for problems where global constants are unavailable or difficult to compute. The proposed algorithm is designed within an abstract linesearch framework for a primal-dual proximal-gradient method to solve min-max convex-concave problems, enabling the consensus constraint to be decoupled from the optimisation task. Our theoretical analysis allows for gradients of functions to be locally Lipschitz continuous, relaxing the prevalent assumption of globally Lipschitz continuous gradients. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_15583 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A distributed proximal splitting method with linesearch for locally Lipschitz gradients Atenas, Felipe Dao, Minh N. Tam, Matthew K. Optimization and Control 90C25, 68W15, 49M27, 65K05 In this paper, we propose a distributed first-order algorithm with backtracking linesearch for solving multi-agent minimisation problems, where each agent handles a local objective involving nonsmooth and smooth components. Unlike existing methods that require global Lipschitz continuity and predefined stepsizes, our algorithm adjusts stepsizes using distributed linesearch procedures, making it suitable for problems where global constants are unavailable or difficult to compute. The proposed algorithm is designed within an abstract linesearch framework for a primal-dual proximal-gradient method to solve min-max convex-concave problems, enabling the consensus constraint to be decoupled from the optimisation task. Our theoretical analysis allows for gradients of functions to be locally Lipschitz continuous, relaxing the prevalent assumption of globally Lipschitz continuous gradients. |
| title | A distributed proximal splitting method with linesearch for locally Lipschitz gradients |
| topic | Optimization and Control 90C25, 68W15, 49M27, 65K05 |
| url | https://arxiv.org/abs/2410.15583 |