A differentiable structural analysis framework for high-performance design optimization

Keith J. Lee, Yijiang Huang, Caitlin T. Mueller
{"title":"A differentiable structural analysis framework for high-performance design optimization","authors":"Keith J. Lee, Yijiang Huang, Caitlin T. Mueller","doi":"arxiv-2409.09247","DOIUrl":null,"url":null,"abstract":"Fast, gradient-based structural optimization has long been limited to a\nhighly restricted subset of problems -- namely, density-based compliance\nminimization -- for which gradients can be analytically derived. For other\nobjective functions, constraints, and design parameterizations, computing\ngradients has remained inaccessible, requiring the use of derivative-free\nalgorithms that scale poorly with problem size. This has restricted the\napplicability of optimization to abstracted and academic problems, and has\nlimited the uptake of these potentially impactful methods in practice. In this\npaper, we bridge the gap between computational efficiency and the freedom of\nproblem formulation through a differentiable analysis framework designed for\ngeneral structural optimization. We achieve this through leveraging Automatic\nDifferentiation (AD) to manage the complex computational graph of structural\nanalysis programs, and implementing specific derivation rules for performance\ncritical functions along this graph. This paper provides a complete overview of\ngradient computation for arbitrary structural design objectives, identifies the\nbarriers to their practical use, and derives key intermediate derivative\noperations that resolves these bottlenecks. Our framework is then tested\nagainst a series of structural design problems of increasing complexity: two\nhighly constrained minimum volume problem, a multi-stage shape and section\ndesign problem, and an embodied carbon minimization problem. We benchmark our\nframework against other common optimization approaches, and show that our\nmethod outperforms others in terms of speed, stability, and solution quality.","PeriodicalId":501309,"journal":{"name":"arXiv - CS - Computational Engineering, Finance, and Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Engineering, Finance, and Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.09247","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Fast, gradient-based structural optimization has long been limited to a highly restricted subset of problems -- namely, density-based compliance minimization -- for which gradients can be analytically derived. For other objective functions, constraints, and design parameterizations, computing gradients has remained inaccessible, requiring the use of derivative-free algorithms that scale poorly with problem size. This has restricted the applicability of optimization to abstracted and academic problems, and has limited the uptake of these potentially impactful methods in practice. In this paper, we bridge the gap between computational efficiency and the freedom of problem formulation through a differentiable analysis framework designed for general structural optimization. We achieve this through leveraging Automatic Differentiation (AD) to manage the complex computational graph of structural analysis programs, and implementing specific derivation rules for performance critical functions along this graph. This paper provides a complete overview of gradient computation for arbitrary structural design objectives, identifies the barriers to their practical use, and derives key intermediate derivative operations that resolves these bottlenecks. Our framework is then tested against a series of structural design problems of increasing complexity: two highly constrained minimum volume problem, a multi-stage shape and section design problem, and an embodied carbon minimization problem. We benchmark our framework against other common optimization approaches, and show that our method outperforms others in terms of speed, stability, and solution quality.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用于高性能设计优化的可微分结构分析框架
长期以来,基于梯度的快速结构优化一直局限于高度受限的问题子集,即基于密度的符合性最小化问题,对于这些问题,梯度可以通过分析得出。对于其他目标函数、约束条件和设计参数化问题,梯度的计算仍然无法实现,需要使用无导数算法,而这种算法的规模与问题规模的关系不大。这限制了优化在抽象和学术问题上的应用,也限制了这些具有潜在影响力的方法在实践中的应用。在本文中,我们通过一个专为一般结构优化设计的可微分分析框架,弥合了计算效率与问题表述自由度之间的差距。为此,我们利用自动微分(AutomaticDifferentiation,AD)来管理结构分析程序的复杂计算图,并沿此图为性能关键函数实施特定的推导规则。本文全面概述了针对任意结构设计目标的梯度计算,指出了其实际应用的障碍,并推导出解决这些瓶颈的关键中间衍生操作。然后,我们用一系列复杂度不断增加的结构设计问题对我们的框架进行了测试:两个高度受限的最小体积问题、一个多阶段形状和截面设计问题以及一个体现碳最小化问题。我们将我们的框架与其他常见的优化方法进行了比较,结果表明我们的方法在速度、稳定性和解决方案质量方面都优于其他方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A generalized non-hourglass updated Lagrangian formulation for SPH solid dynamics A Knowledge-Inspired Hierarchical Physics-Informed Neural Network for Pipeline Hydraulic Transient Simulation Uncertainty Analysis of Limit Cycle Oscillations in Nonlinear Dynamical Systems with the Fourier Generalized Polynomial Chaos Expansion Micropolar elastoplasticity using a fast Fourier transform-based solver A differentiable structural analysis framework for high-performance design optimization
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1