Robustness

In this example, we illustrate the use of the Robustness plot on the Sobieski’s SSBJ problem.

from __future__ import annotations

from gemseo import configure_logger
from gemseo import create_discipline
from gemseo import create_scenario
from gemseo.problems.sobieski.core.design_space import SobieskiDesignSpace

Import

The first step is to import some high-level functions and a method to get the design space.

configure_logger()

<RootLogger root (INFO)>

Description

In the Robustness post-processing, the robustness of the optimum is represented by a box plot. Using the quadratic approximations of all the output functions, we propagate analytically a normal distribution with 1% standard deviation on all the design variables, assuming no cross-correlations of inputs, to obtain the mean and standard deviation of the resulting normal distribution. A series of samples are randomly generated from the resulting distribution, whose quartiles are plotted, relatively to the values of the function at the optimum. For each function (in abscissa), the plot shows the extreme values encountered in the samples (top and bottom bars). Then, 95% of the values are within the blue boxes. The average is given by the red bar.

Create disciplines

At this point, we instantiate the disciplines of Sobieski’s SSBJ problem: Propulsion, Aerodynamics, Structure and Mission

disciplines = create_discipline([
    "SobieskiPropulsion",
    "SobieskiAerodynamics",
    "SobieskiStructure",
    "SobieskiMission",
])

Create design space

We also create the SobieskiDesignSpace.

design_space = SobieskiDesignSpace()

Create and execute scenario

The next step is to build an MDO scenario in order to maximize the range, encoded ‘y_4’, with respect to the design parameters, while satisfying the inequality constraints ‘g_1’, ‘g_2’ and ‘g_3’. We can use the MDF formulation, the SLSQP optimization algorithm and a maximum number of iterations equal to 100.

scenario = create_scenario(
    disciplines,
    "MDF",
    "y_4",
    design_space,
    maximize_objective=True,
)
scenario.set_differentiation_method()
for constraint in ["g_1", "g_2", "g_3"]:
    scenario.add_constraint(constraint, constraint_type="ineq")
scenario.execute({"algo": "SLSQP", "max_iter": 10})

    INFO - 13:13:06:
    INFO - 13:13:06: *** Start MDOScenario execution ***
    INFO - 13:13:06: MDOScenario
    INFO - 13:13:06:    Disciplines: SobieskiAerodynamics SobieskiMission SobieskiPropulsion SobieskiStructure
    INFO - 13:13:06:    MDO formulation: MDF
    INFO - 13:13:06: Optimization problem:
    INFO - 13:13:06:    minimize -y_4(x_shared, x_1, x_2, x_3)
    INFO - 13:13:06:    with respect to x_1, x_2, x_3, x_shared
    INFO - 13:13:06:    subject to constraints:
    INFO - 13:13:06:       g_1(x_shared, x_1, x_2, x_3) <= 0.0
    INFO - 13:13:06:       g_2(x_shared, x_1, x_2, x_3) <= 0.0
    INFO - 13:13:06:       g_3(x_shared, x_1, x_2, x_3) <= 0.0
    INFO - 13:13:06:    over the design space:
    INFO - 13:13:06:       +-------------+-------------+-------+-------------+-------+
    INFO - 13:13:06:       | Name        | Lower bound | Value | Upper bound | Type  |
    INFO - 13:13:06:       +-------------+-------------+-------+-------------+-------+
    INFO - 13:13:06:       | x_shared[0] |     0.01    |  0.05 |     0.09    | float |
    INFO - 13:13:06:       | x_shared[1] |    30000    | 45000 |    60000    | float |
    INFO - 13:13:06:       | x_shared[2] |     1.4     |  1.6  |     1.8     | float |
    INFO - 13:13:06:       | x_shared[3] |     2.5     |  5.5  |     8.5     | float |
    INFO - 13:13:06:       | x_shared[4] |      40     |   55  |      70     | float |
    INFO - 13:13:06:       | x_shared[5] |     500     |  1000 |     1500    | float |
    INFO - 13:13:06:       | x_1[0]      |     0.1     |  0.25 |     0.4     | float |
    INFO - 13:13:06:       | x_1[1]      |     0.75    |   1   |     1.25    | float |
    INFO - 13:13:06:       | x_2         |     0.75    |   1   |     1.25    | float |
    INFO - 13:13:06:       | x_3         |     0.1     |  0.5  |      1      | float |
    INFO - 13:13:06:       +-------------+-------------+-------+-------------+-------+
    INFO - 13:13:06: Solving optimization problem with algorithm SLSQP:
    INFO - 13:13:06:     10%|█         | 1/10 [00:00<00:01,  8.63 it/sec, obj=-536]
    INFO - 13:13:06:     20%|██        | 2/10 [00:00<00:01,  6.14 it/sec, obj=-2.12e+3]
 WARNING - 13:13:06: MDAJacobi has reached its maximum number of iterations but the normed residual 2.338273970736908e-06 is still above the tolerance 1e-06.
    INFO - 13:13:06:     30%|███       | 3/10 [00:00<00:01,  5.24 it/sec, obj=-3.56e+3]
    INFO - 13:13:06:     40%|████      | 4/10 [00:00<00:01,  5.01 it/sec, obj=-3.96e+3]
    INFO - 13:13:07:     50%|█████     | 5/10 [00:01<00:01,  4.88 it/sec, obj=-3.96e+3]
    INFO - 13:13:07: Optimization result:
    INFO - 13:13:07:    Optimizer info:
    INFO - 13:13:07:       Status: 8
    INFO - 13:13:07:       Message: Positive directional derivative for linesearch
    INFO - 13:13:07:       Number of calls to the objective function by the optimizer: 6
    INFO - 13:13:07:    Solution:
    INFO - 13:13:07:       The solution is feasible.
    INFO - 13:13:07:       Objective: -3963.403105287515
    INFO - 13:13:07:       Standardized constraints:
    INFO - 13:13:07:          g_1 = [-0.01806054 -0.03334606 -0.04424918 -0.05183437 -0.05732588 -0.13720864
    INFO - 13:13:07:  -0.10279136]
    INFO - 13:13:07:          g_2 = 3.1658077606078194e-06
    INFO - 13:13:07:          g_3 = [-7.67177346e-01 -2.32822654e-01 -5.57051011e-06 -1.83255000e-01]
    INFO - 13:13:07:       Design space:
    INFO - 13:13:07:          +-------------+-------------+---------------------+-------------+-------+
    INFO - 13:13:07:          | Name        | Lower bound |        Value        | Upper bound | Type  |
    INFO - 13:13:07:          +-------------+-------------+---------------------+-------------+-------+
    INFO - 13:13:07:          | x_shared[0] |     0.01    | 0.06000079145194018 |     0.09    | float |
    INFO - 13:13:07:          | x_shared[1] |    30000    |        60000        |    60000    | float |
    INFO - 13:13:07:          | x_shared[2] |     1.4     |         1.4         |     1.8     | float |
    INFO - 13:13:07:          | x_shared[3] |     2.5     |         2.5         |     8.5     | float |
    INFO - 13:13:07:          | x_shared[4] |      40     |          70         |      70     | float |
    INFO - 13:13:07:          | x_shared[5] |     500     |         1500        |     1500    | float |
    INFO - 13:13:07:          | x_1[0]      |     0.1     |  0.3999999322608766 |     0.4     | float |
    INFO - 13:13:07:          | x_1[1]      |     0.75    |         0.75        |     1.25    | float |
    INFO - 13:13:07:          | x_2         |     0.75    |         0.75        |     1.25    | float |
    INFO - 13:13:07:          | x_3         |     0.1     |  0.1562438752833519 |      1      | float |
    INFO - 13:13:07:          +-------------+-------------+---------------------+-------------+-------+
    INFO - 13:13:07: *** End MDOScenario execution (time: 0:00:01.173766) ***

{'max_iter': 10, 'algo': 'SLSQP'}

Post-process scenario

Lastly, we post-process the scenario by means of the Robustness which plots any of the constraint or objective functions w.r.t. the optimization iterations or sampling snapshots.

Tip

Each post-processing method requires different inputs and offers a variety of customization options. Use the high-level function get_post_processing_options_schema() to print a table with the options for any post-processing algorithm. Or refer to our dedicated page: Post-processing algorithms.

scenario.post_process("Robustness", save=False, show=True)

<gemseo.post.robustness.Robustness object at 0x7f8bd79b43a0>