A Rearranged Dual Scheme For Structural Optimization
Price
Free (open access)
Transaction
Volume
2
Pages
14
Published
1993
Size
1,073 kb
Paper DOI
10.2495/OP930431
Copyright
WIT Press
Author(s)
O. Jonsson, T. Larsson & M. Ronnqvist
Abstract
A rearranged dual scheme for structural optimization 6. Jonsson, T. Larsson, M. Ronnqvist Department of Mathematics, Linkoping Institute of Technology, S-581 83 Linkoping, Sweden ABSTRACT A commonly used and efficient approach to structural optimization is to solve a sequence of approximate design problems, which are constructed iteratively. As is well-known, a major part of the computational burden of this scheme lies in the sensitivity analysis needed to state the approximate problems. We propose a possibility to reduce these computations by streamlining the calculations in the well-known combined approximation and duality scheme for structural optimiza- tion. The difference to the traditional scheme is that, instead of calculating all the constraint gradients to state an approximate design problem, linear combina- tions of these gradients are generated as they are needed during the solution of the approximate problem using the dual method. We show, by analyzing some typical scena
Keywords
