===affil2:
The University of Edinburgh
===firstname:
Martin
===firstname4:

===firstname3:
Martin
===lastname2:
Richtarik
===lastname:
Takáč
===firstname5:

===affil6:

===lastname3:
Takac
===email:
martin.taki@gmail.com
===lastname6:

===affil5:

===otherauths:

===lastname4:

===affil4:

===lastname7:

===affil7:

===firstname7:

===postal:
2 Cameron Terrace
Edinburgh
EH16 5LD
===firstname6:

===ABSTRACT:
In this work we propose solving \emph{huge-scale} instances of the truss topology design problem with coordinate descent methods. 
We develop four efficient codes: \emph{serial} and \emph{parallel} implementations of \emph{randomized} and \emph{greedy} rules for the selection of the variable (potential bar) to be updated in the next iteration. Both serial methods enjoy an $O(n/k)$ iteration complexity guarantee, where $n$ is the number of potential bars and $k$ the iteration counter. Our parallel implementations, written in CUDA and running on a graphical processing unit (GPU), are capable of speedups of up to two orders of magnitude when compared to their serial counterparts.  Numerical experiments were performed on instances with up to 30 million potential bars.
===affil3:
The University of Edinburgh
===lastname5:

===affilother:

===title:
Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design
===firstname2:
Peter