Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Theses and Dissertations

1994

Structural optimization

Articles 1 - 2 of 2

Full-Text Articles in Physical Sciences and Mathematics

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson Mar 1994

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson

Theses and Dissertations

Large-scale structural optimization problems are often difficult to solve with reasonable efficiency and accuracy. Such problems are often characterized by constraint functions which are not explicitly defined. Constraint and gradient functions are usually expensive to evaluate. An optimization approach which uses the NLPQL sequential quadratic programming algorithm of Schittkowski, integrated with the Automated Structural Optimization System ASTROS is tested. The traditional solution approach involves the formulation and solution of an explicitly defined approximate problem during each iteration. This approach is replaced by a simpler approach in which the approximate problem is eliminated. In the simpler approach, each finite element analysis …


An Investigation Of Simulated Annealing Applied To Structural Optimization Problems, Richard C. Mceachin Mar 1994

An Investigation Of Simulated Annealing Applied To Structural Optimization Problems, Richard C. Mceachin

Theses and Dissertations

This thesis investigates the feasibility of using Simulated Annealing SA in structural optimization problems. The investigation involves solving benchmark structural optimization problems with an SA algorithm, and comparing its solutions to those found by four other optimizers. Overall, the analysis shows that SA has limited applicability in structural optimization. Two primary factors were found to adversely impact the performance of the SA algorithm in these problems. These factors are high dimensionality, and high levels of constraint. The difficulty involved in solving these problems with a random search increases exponentially with the number of dimensions. The number, and non-linearity, of the …