Shape structural optimization with an interior point nonlinear programming algorithm

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 Dire...

Full description

Saved in:
Bibliographic Details
Published in:Structural and multidisciplinary optimization Vol. 20; no. 2; pp. 107 - 115
Main Authors: Herskovits, J., Dias, G., Santos, G., Mota Soares, C.M.
Format: Journal Article
Language:English
Published: Berlin Springer 01.10.2000
Springer Nature B.V
Subjects:
Algorithms
Applied sciences
Exact sciences and technology
Industrial design, planning, organization, safety
Mechanical engineering. Machine design
Mesh generation
Nonlinear programming
Shape optimization
B spline
Geometrical shape
Cost minimization
Biaxial stress
Interior point method
Iterative method
Two dimensional model
Non linear programming
Automatic mesh generation
Solid
Spline approximation
Coding
Cost function
Non linear effect
Newton method
Control point
Structural analysis
ISSN:1615-147X, 1615-1488
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1615-147X
1615-1488
DOI:10.1007/s001580050142