Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
复制标题
DOI：
10.1007/s10589-018-0013-3
复制
发表时间：
2017-11
影响因子：
2.2
通讯作者：
Y. Kanno
中科院分区：
文献类型：
--
作者：
Y. Kanno
针对不确定静态外载荷的鲁棒桁架拓扑优化可表述为混合整数半定规划。分支定界法虽然可以求出全局最优解，但耗时较长。本文提出了一种替代的形式，具有互补约束的半定规划，并提出了一种有效的启发式方法。该方法基于凸差分规划的凹-凸过程。结果表明，该方法通常可以在求解几十个凸优化子问题的计算量之内找到一个实际合理的桁架设计。
The robust truss topology optimization against the uncertain static external load can be formulated as mixed-integer semidefinite programming. Although a global optimal solution can be computed with a branch-and-bound method, it is very time-consuming. This paper presents an alternative formulation, semidefinite programming with complementarity constraints, and proposes an efficient heuristic. The proposed method is based upon the concave–convex procedure for difference-of-convex programming. It is shown that the method can often find a practically reasonable truss design within the computational cost of solving some dozen of convex optimization subproblems.