.png){kind=icon}
返回
Sequential conservative integer programming method for multi-constrained discrete variable structure topology optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s10409-023-23151-x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The sequential approximate integer programming (SAIP) method successfully solves multiple types of large-scale topology optimization problems by solving a sequence of separable approximate integer programming subproblems. However, these subproblems must be with quadratic/linear objective function with linear constraints that can be analytically solved by the canonical relaxation algorithm (CRA). Besides, SAIP relies on the decreasing volume fraction strategy so that it owns difficulties to confront topology optimization problems without active volume constraints. The success of MMA (method of moving asymptotic) inspires us to introduce the classical sequential conservative approximate programming that can generate a sequence of steadily improving feasible designs and present a sequential conservative integer programming (SCIP) method for the development of SAIP. This new method generates a sequence of nonlinear approximate integer programming subproblems containing the reciprocal variables, whose conservation is controlled by moving asymptotes. Since CRA is invalid for nonlinear subproblems, a simple design variable update rule derived by the KKT (Karush-Kuhn-Tucker) conditions is given. Based on the above idea, SCIP obtains stable optimization processes without relying on linear constraints, such as the volume constraint, and thus complex discrete variable topology optimization problems can be efficiently solved. Various requirements of topology optimization problems are handled, including equality or inequality constraints, and inactive or active volume constraints. Numerical results show that since the conservative property has been inherited, the convergence of the optimization process can be regulated without additional structural analysis.
Keyword:
Topology optimization
Sequential approximate integer programming
Sequential conservative integer programming
Augmented Lagrange formulation
Compliant mechanism
期刊
A
IF:
4.6
论文数:
2.9K
被引数:
5.5K
机构
引用论文
.png){kind=icon}
Immunohistochemical expression of cell adhesion molecule L1 during development of the human brain
PREAI
分享收藏分享收藏
分享收藏SURF: A connectivity-based space filling curve construction algorithm in high genus 3D surface WSNsSURF: 一种基于连通性的高属三维曲面WSNs空间填充曲线构建算法
PREAI
分享收藏Convergent and mesh-independent solutions for the bi-directional evolutionary structural optimization method双向进化结构优化方法的收敛和网格无关解
PREAI
分享收藏
查看更多内容