An SQP Algorithm for Structural Topology Optimization Based on Majorization–Minimization Method

When applying the sequential quadratic programming (SQP) algorithm to topology optimization, using the quasi-Newton methods or calculating the Hessian matrix directly will result in a considerable amount of calculation, making it computationally infeasible when the number of optimization variables i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied sciences Ročník 12; číslo 13; s. 6304
Hlavní autoři: Liao, Weilong, Zhang, Qiliang, Meng, Huanli
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.07.2022
Témata:
Algorithms
Approximation
Compliance
Hessian matrix
Linear programming
majorization–minimization
Methods
Optimization
sequential quadratic programming
topology optimization
Variables
ISSN:2076-3417, 2076-3417
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:When applying the sequential quadratic programming (SQP) algorithm to topology optimization, using the quasi-Newton methods or calculating the Hessian matrix directly will result in a considerable amount of calculation, making it computationally infeasible when the number of optimization variables is large. To solve the above problems, this paper creatively proposes a method for calculating the approximate Hessian matrix for structural topology optimization with minimum compliance problems. Then, the second-order Taylor expansion transforms the original problem into a series of separable and easy-to-solve convex quadratic programming (QP) subproblems. Finally, the quadratic programming optimality criteria (QPOC) method and the QP solver of MATLAB are used to solve the subproblems. Compared with other sequential quadratic programming methods, the advantage of the proposed method is that the Hessian matrix is diagonally positive definite and its calculation is simple. Numerical experiments on an MBB beam and cantilever beam verify the feasibility and efficiency of the proposed method.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2076-3417
2076-3417
DOI:10.3390/app12136304