Numerical comparison of nonlinear programming algorithms for structural optimization
For FE-based structural optimization systems, a large variety of different numerical algorithms is available, e.g. sequential linear programming, sequential quadratic programming, convex approximation, generalized reduced gradient, multiplier, penalty or optimality criteria methods, and combinations...
Saved in:
| Published in | Structural Optimization Vol. 7; no. 1-2; pp. 1 - 19 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
01.02.1994
|
| Online Access | Get full text |
| ISSN | 0934-4373 1615-147X 1615-1488 |
| DOI | 10.1007/BF01742498 |
Cover
| Summary: | For FE-based structural optimization systems, a large variety of different numerical algorithms is available, e.g. sequential linear programming, sequential quadratic programming, convex approximation, generalized reduced gradient, multiplier, penalty or optimality criteria methods, and combinations of these approaches. The purpose of the paper is to present the numerical results of a comparative study of eleven mathematical programming codes which represent typical realizations of the mathematical methods mentioned. They are implemented in the structural optimization system MBB-LAGRANGE, which proceeds from a typical finite element analysis. The comparative results are obtained from a collection of 79 test problems. The majority of them are academic test cases, the others possess some practicalreal life background. Optimization is performed with respect to sizing of trusses and beams, wall thicknesses, etc., subject to stress, displacement, and many other constraints. Numerical comparison is based on reliability and efficiency measured by calculation time and number of analyses needed to reach a certain accuracy level. |
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| ISSN: | 0934-4373 1615-147X 1615-1488 |
| DOI: | 10.1007/BF01742498 |