Author(s)

C. Fleury & W.H. Zhang

Abstract

Convex approximation methods used in structural optimization are discussed in this paper. These methods ranging from CONLIN (CONvex LINearization method), MMA (the Method of the Moving Asymptotes) to SQP (Sequential Quadratic Programming method) can be basically classified as monotonic and non-monotonic approximations. It is shown that for the considered problems of different nature, the achievement of a successful and efficient design will essentially depend upon whether approximation schemes can be appropriately selected. To ensure the approximation quality, a GMMA (Generalized Method of the Moving Asymptotes) and a DQA (Diagonal Quadratic Approximation) based optimizers are developed respectively in this work. In addition, it can be seen that the mixed approximati

Keywords