x
Our website uses cookies. By using the website you agree ot its use. More information can be found in our privacy policy.

Setting parameters for metamodel-based optimization strategies

There are three recommended strategies for automating the metamodel-based optimization procedure. These strategies apply to the tasks: Metamodel-based Optimization and RBDO.

Single stage

In this approach, the experimental design for choosing the sampling points is done only once. A typical application would be to choose a large number of points (as much as can be afforded) to build metamodels such as, RBF networks using the Space Filling sampling method. This is probably the best way of sampling for Space Filling since the Space Filling algorithm positions all the points in a single cycle.

Example

solvers 1
responses 1
variables 2
 Variable 'tbumper' 3
  Lower bound variable 'tbumper' 1
  Upper bound variable 'tbumper' 5
 Variable 'thood' 1
  Lower bound variable 'thood' 1
  Upper bound variable 'thood' 5
Optimization Method SRSM
 solver dyna960 '1'
  solver command "ls971_single"
  solver input file "main.k"
  solver order RBF
  solver experiment design space_filling
   solver number experiments 15
  response 'HIC' 1 0 "BinoutResponse -res_type Nodout -cmp HIC15 -gravity 9810.00000
-units S -id 432 "
 objectives 1
 objective 'HIC' 1
constraints 0
 iterate param design 0.01
 iterate param objective 0.01
 iterate param stoppingtype or
 iterate 1
STOP

Required settings:

  1. Use RBF networks or FF neural networks. RBF networks are much quicker and in some cases more accurate than FF networks.
  2. Select the number of sampling points.
  3. Since there is only one iteration, unset the selection for “First iteration Linear, D-Optimal”.
  4. Adjust the iteration limit in the GUI Run panel to 1.

The following options should default to the settings indicated:

  1. Space Filling sampling.

The GUI settings are also explained in Figure 20.1.

fig20-1

Figure 20.1 Required settings in Sampling panel for Single Stage strategy

Sequential strategy

In this approach, sampling is done sequentially. A small number of points is chosen for each iteration and multiple iterations are requested. The approach has the advantage that the iterative process can be stopped as soon as the metamodels or optimum points have sufficient accuracy. It was demonstrated in Reference [16] that, for Space Filling, the Sequential approach had similar accuracy compared to the Single Stage approach,i.e. 10 × 30 points added sequentially is almost as good as 300 points. Therefore both the Single Stage and Sequential Methods are good for design exploration using a surrogate model. For instance when constructing a Pareto Optimal Front, the use of a Single Stage or Sequential strategy is recommended in lieu of a Sequential strategy with domain reduction (see Sequential strategy with domain reduction).

Both the previous strategies work better with metamodels other than polynomials because of the flexibility of metamodels such as neural networks to adjust to an arbitrary number of points.

Example

Optimization Method SRSM
 solver dyna960 '1'
  solver command "ls971_single"
  solver input file "main.k"
  solver order RBF
  solver experiment design space_filling
   solver update doe
   solver alternate experiment 1
  response 'HIC' 1 0 "BinoutResponse -res_type Nodout -cmp HIC15 -gravity 9810.00000
-units S -id 432 "
objectives 1
 objective 'HIC' 1
constraints 0
iterate param design 0.01
 iterate param objective 0.01
 iterate param adapt off iteration 1
 iterate param stoppingtype or
 iterate 3
STOP

Required settings:

  1. Choose either RBF networks or FF neural networks. RBF networks are much quicker and in some cases more accurate than FF networks.
  2. Adjust the iteration limit.
  3. Set the Advanced option in the Run panel named “Freeze range from iter” to 1. This selection will ensure that the region of interest remains the full design space from iteration to iteration. (iterate param adapt off iteration 1)

The following options should default to the settings indicated:

  1. Space Filling sampling.
  2. The first iteration is Linear D-Optimal.
  3. Use adaptive sampling. This implies that the positions of points belonging to previous iterations are taken into account when choosing new Space Filling points. Metamodels are also built using all available points, including those of previous iterations. The GUI check box is “Augment points, update surface”.
  4. Choose the number of points per iteration to not be less than the default for a linear approximation ( 1.5(n + 1) + 1 ).

The GUI settings are also explained in Figure 20.2.

 fig20-2.png

Figure 20.2 Required settings in Sampling panel (left) and Run panel (right) for sequential strategy without domain reduction

Sequential strategy with domain reduction

This approach is the same as that in Section Sequential strategy but in each iteration the domain reduction strategy is used to reduce the size of the subregion. During a particular iteration, the subregion is used to bound the positions of new points. This method is typically the only one suitable for polynomials. There are two approaches to Sequential Domain Reduction strategies. The first is global and the second, local.

Sequential Adaptive Metamodeling (SAM)

This approach is the same as that in Section Sequential strategy but in each iteration the domain reduction strategy is used to reduce the size of the subregion. During a particular iteration, the subregion is used to bound the positions of new points. This method is typically the only one suitable for polynomials. There are two approaches to Sequential Domain Reduction strategies. The first is global and the second, local.

Sequential Adaptive Metamodeling (SAM)

As for the sequential strategy in 4.7.2 (Manual) without domain reduction, sequential adaptive sampling is done and the metamodel constructed using all available points, including those belonging to previous iterations. The difference is that in this case, the size of the subregion is adjusted (usually reduced) for each iteration (see Section 4.6 in Manual). This method is good for converging to an optimum and moderately good for constructing global approximations for design exploration such as a Pareto Optimal front. The user should however expect to have poorer metamodel accuracy at design locations remote from the current optimum.

Example

Optimization Method SRSM
solver dyna960 '1'
  solver command "ls971_single"
  solver input file "main.k"
  solver order RBF
  solver experiment design space_filling
   solver update doe
   solver alternate experiment 1
  response 'HIC' 1 0 "BinoutResponse -res_type Nodout -cmp HIC15 -gravity 9810.00000
-units S -id 432 "
objectives 1
 objective 'HIC' 1
constraints 0
iterate param design 0.01
 iterate param objective 0.01
 iterate param stoppingtype or
 iterate 3
STOP

Required settings:

  1. Choose either RBF or FF neural networks. RBF networks are much quicker than FF networks. RBF networks have shown some sensitivity to domain reduction methods.
  2. Set the iteration limit.

The following options should default to the settings indicated:

  1. Space Filling sampling.
  2. Choose the number of points per iteration to not be less than the default for a linear approximation ( 1.5(n + 1) + 1 ).
  3. Check the box for the first iteration to be Linear D-Optimal.
  4. Use adaptive sampling. This implies that the positions of points belonging to previous iterations are taken into account when choosing new Space Filling points. Metamodels are also built using all available points, including those of previous iterations.

In the GUI, the sampling panel setting is the same as in Figure 20-2 (left). However, the “Freeze range from Iter” option in the Run panel is not used.

Sequential Response Surface Method (SRSM)

SRSM is the original LS-OPT automation strategy and allows the building of a new response surface (typically linear polynomial) in each iteration. The size of the subregion is adjusted for each iteration (see Section 4.6). Points belonging to previous iterations are ignored. This method is only suitable for convergence to an optimum and should not be used to construct a Pareto optimal front or do any other type of design exploration. Therefore the method is ideal for system identification (see Section 5.3 in Manual).

Example

Optimization Method SRSM
solver dyna960 '1'
  solver command "ls971_single"
  solver input file "main.k"
  solver order linear
  solver experiment design dopt
response 'HIC' 1 0 "BinoutResponse -res_type Nodout -cmp HIC15 -gravity 9810.00000 -
units S -id 432 "
objectives 1
 objective 'HIC' 1
constraints 0
iterate param design 0.01
 iterate param objective 0.01
 iterate param stoppingtype or
 iterate 3
STOP

Required Settings:

  1. Set the iteration limit in the Run panel.

The following options should default to the settings indicated:

  1. Linear polynomial
  2. D-optimal sampling
  3. Default number of sampling points (see Table 2.2-1 in Manual).