Skip to main content

Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design

  • Conference paper
  • First Online:
Operations Research Proceedings 2011

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

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(s) (potential bar(s)) 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ben-Tal, A., Nemirovski, A.: Robust truss topology design via semidefinite programming, SIAM Journal on Optimization 7, 991–1016 (1997)

    Article  Google Scholar 

  2. GilbertM., Tyas A.: Layout optimization of large-scale pin-jointed frames, Engineering Computations 20 (8), 1044–1064 (2003)

    Google Scholar 

  3. Koˇcvara, M.: Truss topology design with integer variables made easy, Opt. Online (2010)

    Google Scholar 

  4. Li, Y., Osher, S.: Coordinate descent optimization for l1 minimization with application to compressed sensing; a greedy algorithm, Inverse Problems and Imaging 3, 487–503 (2009)

    Article  Google Scholar 

  5. Nemirovski, A., Ben-Tal, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia, PA, USA (2001)

    Google Scholar 

  6. Nesterov, Yu.: Gradient methods for minimizing composite objective function. CORE Discussion Paper #2007/76 (2007)

    Google Scholar 

  7. Richt´arik, P.: Simultaneously solving seven optimization problems in relative scale. Optimization Online (2009)

    Google Scholar 

  8. Richt´arik, P., Tak´aˇc, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Technical Report ERGO 11-011 (2011)

    Google Scholar 

  9. Rozvany, G., Bendsøe, M.P., Kirsch, U.: Layout optimization of structures. Applied Mechanics Reviews, 48 (2), 41–119 (1995)

    Article  Google Scholar 

  10. Sokół, T.: Topology optimization of large-scale trusses using ground structure approach with selective subsets of active bars. Extended Abstract, Computer Methods in Mechanics (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peter Richtárik .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Richtárik, P., Takáč, M. (2012). Efficient Serial and Parallel Coordinate Descent Methods for Huge-Scale Truss Topology Design. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_5

Download citation

Publish with us

Policies and ethics