Study and implementation of distributed asynchronous algorithms for convex optimizationStudy and implementation of distributed asynchronous algorithms for convex optimizationΜελέτη και υλοποίηση σε κατανεμημένα περιβάλλοντα ασύγχρονων αλγορίθμων κυρτής βελτιστοποίησης Διπλωματική Εργασία Diploma Work 2018-07-132018enWe consider a convex optimization problem with a quadratic cost function. We partition 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. http://creativecommons.org/licenses/by/4.0/Πολυτεχνείο Κρήτης::Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών ΥπολογιστώνStavrianoudaki_Thaleia_Dip_2018.pdfChania [Greece]Library of TUC2018-07-13application/pdf621.8 kBfree Stavrianoudaki Thaleia-Anastasia Σταυριανουδακη Θαλεια-Αναστασια Liavas Athanasios Λιαβας Αθανασιος Karystinos Georgios Καρυστινος Γεωργιος Samoladas Vasilis Σαμολαδας Βασιλης Πολυτεχνείο Κρήτης Technical University of Crete MPI Asynchronous algorithms Convex optimization