This section describes the available solution methodology for Topology Optimization analyses.
The Sequential Convex Programming method (SCP), see Zillober [3, 5, 6], is an extension of the method for moving asymptotes (MMA), see Svanberg [2]. The Sequential Convex Programming method requires the derivatives of all functions present in the topology optimization problem. MMA is a nonlinear programming algorithm that approximates a solution for a topology optimization problem by solving a sequence of convex and separable subproblems. These subproblems can be solved efficiently due to their special structure.
The Sequential Convex Programming method extends MMA to ensure convergence by rejecting steps that do not lead to an optimal solution of the underlying problem. The test for acceptance is done by a merit function and a corresponding line search procedure, see Zillober [4]. The goal of the merit function is to measure the progress and enable the objective function and the constraints to be combined in a suitable way.
The Optimality Criteria method can be used to solve topology optimization problems with a simple compliance objective that uses a volume or mass constraint. The Optimality Criteria method is an iterative solver, see Bensoe and Sigmund [1]. The Optimality Criteria method should not be used for a Modal Analysis.
Note: The following limitations apply when using the Optimality Criteria Solver Type:
Only supports the (Structural) setting for the Response Type column of the Objective object worksheet.
Only and constraints are supported.
The Manufacturing Constraint is supported where only the Minimum property for the Member Size constraint subtype can be specified.
The following topics provide a brief description of how Mechanical defines Natural Frequencies and Global Stress Constraints during a Topology Optimization analysis. Solution convergence criteria is also described.
When performing Topology Optimization with supported natural frequencies, you can specify the frequency as either an objective or as a constraint. A single natural frequency or a weighted combination of several natural frequencies can be defined using the Objective object. The aim of the optimization is to maximize these frequencies according to their weights (as defined in the Worksheet ).
In addition, you can add a single natural frequency as a constraint and define a lower and an upper bound on the frequency. The solver will guarantee, if possible, that this frequency lies within the specified range.
If the design objective is to optimize a frequency, then all of the repeating frequencies are optimized simultaneously.
It is important to note that the mode shapes will change during the iterative solution procedure and that there is no tracking with respect to the initial mode shape. Only the actual value of the specified natural frequency is considered. This means at the final iteration the mode shape may change dramatically in comparison to the initial shape of the optimized mode.
Because the underlying solver is sensitivity based, problems with natural frequencies have to be handled with care. The problem is not deferential in the common sense, such as a case of multiple eigenvalues. Instead, derivatives for multiple eigenvalues have to be calculated in a special way. Since the mode shapes are not unique for multiple eigenvalues, additional effort is necessary to get sensitivities that are independent of the mode shapes. In order to obtain unique sensitivities for these eigenvalues, an additional eigenvalue problem has to be solved for each optimized element, see Seyranian [7].
When working with topological optimization for global stress constraints, you can
specify an upper bound on the stress that has to be satisfied by all elements.
Theoretically, this requires the solution of an optimization problem with
stress constraints, where
denotes the number of optimized elements. Because the
computational effort would be too great to achieve this, a more relaxed
reformulation is applied, see Holmberg [8].
Instead of using
constraints, only a few constraints are added that represent
clusters of the optimized elements. For each cluster a single stress value is
determined that approximates the maximum stress within this cluster. Note that this
approximation under estimates the actual maximum stress of a cluster. Therefore, at
the final iteration, the maximum stress of some optimized elements might be greater
than the user-defined upper bound of the global stress constraint.
The topological optimization solver approaches a stationary point where all constraints are satisfied within a tolerance of 0.1 percent of the defined bound. This tolerance is defined by the Convergence Accuracy property (Analysis Settings > Definition category).
To simplify the notation, we assume that only one constraint exists. The optimality conditions of the topology optimization
problem can be stated with the following equation:
Where denotes the Lagrange function. The Lagrange function is defined
by:
Where is the Lagrange multiplier corresponding to the constraint
, and
is the objective function to be either maximized or minimized. The
solver will stop as soon as the desired tolerance is achieved, where:
, as defined here:
Because approaching this stationary point can require a large number of
iterations, a relaxed convergence criterion is used. The optimization stops as soon
as the following equation has three successive iterations. In this equation,
denotes the vector of pseudo densities of the
iteration.
Note that three successive iterations are considered as the underlying solver is stabilized by a line search procedure. This line search procedure might lead to small changes with respect to the pseudo densities as well as small changes to the objective function. It is possible that the convergence tolerance is satisfied for one iteration but the next iteration leads to a significant improvement of the objective function. Due to the relaxed stopping criterion, the optimization might terminate too early. In this case, the optimization should be rerun with a smaller tolerance.
[1] Bendsoe, M.P. and Sigmund O., Topology Optimization: Theory, Methods and Applications, Springer, Berlin, 2003.
[2] Svanberg, K., The Method of Moving Asymptotes { a new method for structural optimization, International Journal for Numerical Methods in Engineering, 24:359-373, 1987.
[3] Zillober, Ch., A globally convergent version of the method of moving asymptotes, Structural Optimization, 6(3):166-174, 1993.
[4] Zillober, Ch., Global convergence of a nonlinear programming method using convex approximations, Numerical Algorithms, 27(3):256-289, 2001.
[5] Zillober, Ch., A combined convex approximation { interior point approach for large scale nonlinear programming, Optimization and Engineering, 2(1):51-73, 2001.
[6] Zillober, Ch., SCPIP {an e\u000Ecient software tool for the solution of structural optimization problems, Structural and Multidisciplinary Optimization, 24(5), 2002.
[7] Seyranian, A.P., Lund E., and Olhoff N., Multiple eigenvalues in structural optimization problems, Structural Optimization, 8:207-227, 1994.
[8] Holmberg E., Torstenfelt B., and Klarbring A., Stress constrained topology optimization, Structural and Multidisciplinary Optimization, 48(1):33-47,2013.