.png){kind=icon}
.png){kind=icon}
Return
Shape structural optimization with an interior point nonlinear programming algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s001580050142.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of this paper is to study the implementation of an efficient and reliable technique for shape optimization of solids, based on general nonlinear programming algorithms. We also study the practical behaviour for this kind of applications of a quasi-Newton algorithm, based on the Feasible Direction Interior Point Method for nonlinear constrained optimization. The optimal shape of the solid is obtained iteratively. At each iteration, a new shape is generated by B-spline curves and a new mesh is automatically generated. The control point coordinates are given by the design variables. Several illustrative two-dimensional examples are solved in a very efficient way. We conclude that the present approach is simple to formulate and to code and that our optimization algorithm is appropriate for this problem.
Keywords:
shape optimization
nonlinear optimization algorithms
interior point algorithms
Journal
IF:
4
Papers:
4.8K
Citations:
1.7W
Organization
No organization information available