SUMMARYA new method for solving structural optimization problems using a local function approximation algorithm is proposed. This new algorithm, called the Generalized Convex Approximation (GCA), uses the design sensitivity information from the current and previous design points to generate a sequence of convex, separable subproblems. The paper contains the derivation of the parameters associated with the approximation and the formulation of the approximated problem. Numerical results from standard test problems solved using this method are presented. It is observed that this algorithm generates local approximations which lead to faster convergence for structural optimization problems.
To reduce the computational cost of structural optimization problems, a common procedure is to generate a sequence of convex, approximate subproblems and solve them in an iterative fashion. In this paper, a new local function approximation algorithm is proposed to formulate the subproblems. This new algorithm, called Generalized Convex Approximation (GCA), uses the sensitivity information of the current and previous design points to generate a sequence of convex, separable subproblems. This algorithm gives very good local approximations and leads to faster convergence for structural optimization problems. Several numerical results of structural optimization problems are presented.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.