The COC algorithm, part I: Cross-section optimization or sizing

Research output: Contribution to journalArticle

62 Citations (Scopus)

Abstract

In iterative continuum-based optimality criteria (COC) methods, necessary conditions of optimality are first generated analytically using variational methods and then reinterpreted in terms of a fictitious or 'adjoint' structure. Finally, the real and adjoint structures are discretized and the problem is solved by an iterative procedure using finite element (FE) methods. It is shown by means of 'FE simulators' for special classes of problems that a COC optimizer could potentially handle millions of variables in cross-section optimization (or sizing), thereby not only eliminating but also reversing the present discrepancy between analysis capability and optimization capability.

Original languageEnglish
Pages (from-to)281-308
Number of pages28
JournalComputer Methods in Applied Mechanics and Engineering
Volume89
Issue number1-3
DOIs
Publication statusPublished - Aug 1991

ASJC Scopus subject areas

  • Computational Mechanics
  • Mechanics of Materials
  • Mechanical Engineering
  • Physics and Astronomy(all)
  • Computer Science Applications

Fingerprint Dive into the research topics of 'The COC algorithm, part I: Cross-section optimization or sizing'. Together they form a unique fingerprint.

  • Cite this