Nonlinear programming approach to automated topology optimization

The paper presents an analytical approach to the optimization of the topological configuration of a set of functional blocks. By expressing the overlapping of blocks as an inequality constraint in a formulation based on nonlinear optimization, the blocks can move freely without any overlap during the optimization process. Some special characteristics of this problem, which prohibit the direct application of standard search methods for optimization, have been investigated. On the basis of this analysis, a search algorithm is developed. The proposed method allows fully automated design and exhibits computationally efficient convergence to local optima from random initial designs.