.png){kind=icon}
.png){kind=icon}
Return
An efficient second-order SQP method for structural topology optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00158-015-1381-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article presents a Sequential Quadratic Programming (SQP) solver for structural topology optimization problems named TopSQP. The implementation is based on the general SQP method proposed in Morales et al. J Numer Anal 32(2):553-579 (2010) called SQP+. The topology optimization problem is modelled using a density approach and thus, is classified as a nonconvex problem. More specifically, the SQP method is designed for the classical minimum compliance problem with a constraint on the volume of the structure. The sub-problems are defined using second-order information. They are reformulated using the specific mathematical properties of the problem to significantly improve the efficiency of the solver. The performance of the TopSQP solver is compared to the special-purpose structural optimization method, the Globally Convergent Method of Moving Asymptotes (GCMMA) and the two general nonlinear solvers IPOPT and SNOPT. Numerical experiments on a large set of benchmark problems show good performance of TopSQP in terms of number of function evaluations. In addition, the use of second-order information helps to decrease the objective function value.
Keywords:
Topology optimization
Sequential Quadratic Programming
Minimum compliance
Second-order method
Hessian approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
4.8K
Citations:
1.7W