Το work with title Study and implementation of distributed asynchronous algorithms for convex optimization by Stavrianoudaki Thaleia-Anastasia is licensed under Creative Commons Attribution 4.0 International
Bibliographic Citation
Thaleia-Anastasia Stavrianoudaki, "Study and implementation of distributed asynchronous algorithms for convex optimization", Diploma Work, School of Electrical and Computer Engineering, Technical University of Crete, Chania, Greece, 2018
https://doi.org/10.26233/heallink.tuc.78331
We consider a convex optimization problem with a quadratic cost function. Wepartition the data of the problem into a set of processors. We use the Message Passing Interface (MPI) and develop parallel implementations of two iterative methods for the solution of the optimization problem, the Gradient Descent and the Block Coordinate Descent (BCD). We test the convergence properties of the algorithms under various circumstances, by calculating the speed of convergence and the total communication cost.