Computational & Technology Resources
an online resource for computational,
engineering & technology publications 

CivilComp Proceedings
ISSN 17593433 CCP: 83
PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL STRUCTURES TECHNOLOGY Edited by: B.H.V. Topping, G. Montero and R. Montenegro
Paper 214
Optimality Criterion Methods and Sequential Approximate Optimization in the Classical Topology Layout Problem A.A. Groenwold^{1} and L.F.P. Etman^{2}
^{1}Department of Mechanical Engineering, University of Stellenbosch, South Africa
A.A. Groenwold, L.F.P. Etman, "Optimality Criterion Methods and Sequential Approximate Optimization in the Classical Topology Layout Problem", in B.H.V. Topping, G. Montero, R. Montenegro, (Editors), "Proceedings of the Eighth International Conference on Computational Structures Technology", CivilComp Press, Stirlingshire, UK, Paper 214, 2006. doi:10.4203/ccp.83.214
Keywords: topology optimization, optimality criterion, sequential approximate optimization, incomplete series expansion, duality, exponential intervening variables.
Summary
In this paper,
we study the 'classical' topology optimization problem, in which minimum compliance is sought,
subject to a single linear constraint on volume.
We use the
simplest strategy for the introduction of topological features into a structure,
being the popular simple isotropic material with penalization (SIMP) method,
independently proposed by Bendsøe [1] and Rozvany and Zhou [2].
In solving the classical topology optimization problem, the wellknown optimality criterion (OC) method is often used, being an expression of the KarushKuhnTucker stationary conditions at optimality of the Lagrangian of the classical topology optimization problem. Unfortunately, direct application of the OC to the classical topology optimization problem results in severe oscillatory behavior; hence the OC statement is often augmented by a heuristic scheme for updating the design variables and the single Lagrangian multiplier iteratively. As an alternative to the OC methods, sequential approximate optimization (SAO) methods are also often used in topology optimization, in particular when more than one constraint is considered (since OC methods become cumbersome). In turn, the SAO algorithms are often based on strictly convex and separable primal approximate subproblems, which may be transformed into highly efficient dual subproblems when the number of constraints are far less than the number of design variables . Examples of successfull SAO algorithms are, amongst others, the wellknown CONLIN algorithm [3] and its generalization, the method of moving asymptotes (MMA) [4,5]. Both algorithms depend on the sequential solution of strictly convex and separable approximate subproblems, and in both CONLIN and MMA, the approximate subproblems contain reciprocal intervening (intermediate) variables, substituted into the linear first order Taylor series expansion. In this study, we propose strictly convex subproblems for use in SAO algorithms, using duality. Rather than using only the customary reciprocal intervening variables, we also resort to exponential intervening variables. The subproblems may then be solved in a rudimentary SAO algorithm. We then demonstrate that direct application of the everpopular optimality criterion to the classical topology optimization problem, combined with the heuristic updating scheme proposed by Bendsøe [1], is similar to a rudimentary dual SAO algorithm in which the subproblems are based on reciprocal intervening variables. The rigorous dual algorithmic development however does not require heuristics like numerical damping coefficients in the iterative updating scheme. Instead, the updating scheme follows naturally. In fact, the 'direct' OC method with numerical damping and the SAO algorithm based on reciprocal intervening variables are identical if the numerical damping coefficient in the direct OC method is, as usual, selected as . The relationship between dual SAO algorithms and OC methods has previously been demonstrated for the minimum weight optimization problem (i.e. for problems with a linear objective function), but seemingly, not for the topology problem. In fact, Bendsøe [1] remarks that the 'direct' OC method in topology optimization is reminiscent of the fully stressed design (FSD) problem. Finally, we show that the use of exponential intervening variables results in a dual formulation of superior efficiency and accuracy to subproblems based on reciprocal intervening variables (and hence, the OC method with the numerical damping coefficient hitherto used), at very little added complexity. Computational experiments confirm the efficiency of our proposed methodology; to this end, comparative results for the method of moving asymptotes (MMA) are presented. References
purchase the fulltext of this paper (price £20)
go to the previous paper 
