Latafat, Puya (2020) Distributed proximal algorithms for large-scale structured optimization. Advisor: Patrinos, Prof. Panagiotis. Coadvisor: Bemporad, Prof. Alberto . pp. 235. [IMT PhD Thesis]
![[img]](http://e-theses.imtlucca.it/style/images/fileicons/text.png) |
Text (Doctoral thesis)
Latafat_phdthesis.pdf - Published Version Available under License Creative Commons Attribution Non-commercial Share Alike. Download (1MB) |
Abstract
Efficient first-order algorithms for large-scale distributed optimization is the main subject of investigation in this thesis. The algorithms considered cover a wide array of applications in machine learning, signal processing and control. In recent years, a large number of algorithms have been introduced that rely on (possibly a reformulation of) one of the classical splitting algorithms, specifically forward-backward, Douglas-Rachford and forward-backward-forward splittings. In this thesis a new three term splitting technique is developed that recovers forward-backward and Douglas-Rachford splittings as special cases. In the context of structured optimization, this splitting is leveraged to develop a framework for a large class of primal-dual algorithms providing a unified convergence analysis for many seemingly unrelated algorithms. Moreover, linear convergence is established for all such algorithms under mild regularity conditions for the cost functions. As another notable contribution we propose a randomized block-coordinate primal-dual algorithm that leads to a fully distributed asynchronous algorithm in a multi-agent model. Moreover, when specializing to multi-agent structured optimization over graphs, novel algorithms are proposed. In addition, it is shown that in a multi-agent model bounded communication delays are tolerated by primal-dual algorithms provided that certain strong convexity assumptions hold. In the final chapter we depart from convex analysis and consider a fully nonconvex block-coordinate proximal gradient algorithm and show that it leads to nonconvex incremental aggregated algorithms for regularized finite sum and sharing problems with very general sampling strategies.
| Item Type: | IMT PhD Thesis |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| PhD Course: | Control systems |
| Identification Number: | https://doi.org/10.6092/imtlucca/e-theses/314 |
| NBN Number: | urn:nbn:it:imtlucca-27029 |
| Date Deposited: | 15 Jul 2020 06:36 |
| URI: | http://e-theses.imtlucca.it/id/eprint/314 |
Actions (login required, only for staff repository)
 |
View Item |
