|Title of host publication||Operations Research Proceedings 2011|
|Subtitle of host publication||Selected Papers of the International Conference on Operations Research (OR 2011), August 30 - September 2 2011, Zurich, Switzerland|
|State||Published - 2012|
In this work we propose solving huge-scale instances of the truss topology
design problem with coordinate descent methods. We develop four efficient codes: serial and parallel implementations of randomized and 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.