Note
Go to the end to download the full example code
Multistart optimization¶
Runs simple optimization problem with multiple starting points
Nests an MDOScenario
in a DOEScenario
using an MDOScenarioAdapter
.
from __future__ import annotations
from gemseo import configure_logger
from gemseo import create_design_space
from gemseo import create_discipline
from gemseo import create_scenario
from gemseo.disciplines.scenario_adapters.mdo_scenario_adapter import MDOScenarioAdapter
configure_logger()
<RootLogger root (INFO)>
Create the disciplines¶
objective = create_discipline("AnalyticDiscipline", expressions={"obj": "x**3-x+1"})
constraint = create_discipline(
"AnalyticDiscipline", expressions={"cstr": "x**2+obj**2-1.5"}
)
Create the design space¶
design_space = create_design_space()
design_space.add_variable("x", l_b=-1.5, u_b=1.5, value=1.5)
Create the MDO scenario¶
scenario = create_scenario(
[objective, constraint],
formulation="DisciplinaryOpt",
objective_name="obj",
design_space=design_space,
)
scenario.default_inputs = {"algo": "SLSQP", "max_iter": 10}
scenario.add_constraint("cstr", "ineq")
Create the scenario adapter¶
dv_names = scenario.formulation.opt_problem.design_space.variable_names
adapter = MDOScenarioAdapter(
scenario, dv_names, ["obj", "cstr"], set_x0_before_opt=True
)
Create the DOE scenario¶
scenario_doe = create_scenario(
adapter,
formulation="DisciplinaryOpt",
objective_name="obj",
design_space=design_space,
scenario_type="DOE",
)
scenario_doe.add_constraint("cstr", "ineq")
run_inputs = {"n_samples": 10, "algo": "fullfact"}
scenario_doe.execute(run_inputs)
INFO - 10:51:45:
INFO - 10:51:45: *** Start DOEScenario execution ***
INFO - 10:51:45: DOEScenario
INFO - 10:51:45: Disciplines: MDOScenario_adapter
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 1.5 | 1.5 | float |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm fullfact:
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.5 | 1.5 | float |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 129.09 it/sec, obj=-.875]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 170.02 it/sec, obj=-.267]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 227.21 it/sec, obj=-.809]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 271.81 it/sec, obj=-.868]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 307.81 it/sec, obj=-.872]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 319.83 it/sec, obj=-.265]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 329.09 it/sec, obj=0.136]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 337.35 it/sec, obj=0.579]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 356.33 it/sec, obj=0.289]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 360.95 it/sec, obj=1.25]
WARNING - 10:51:45: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
WARNING - 10:51:45: The solution is not feasible.
INFO - 10:51:45: Objective: 0.2888129873625884
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = 0.1513713660745195
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.252181466244097 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.041158) ***
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 21.04 it/sec, obj=0.289]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.166666666666667 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1025.00 it/sec, obj=0.579]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 463.79 it/sec, obj=-.875]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 447.17 it/sec, obj=-.267]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 487.34 it/sec, obj=-.809]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 514.06 it/sec, obj=-.868]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 533.28 it/sec, obj=-.874]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 510.36 it/sec, obj=-.266]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 493.53 it/sec, obj=0.135]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 480.82 it/sec, obj=0.577]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 494.51 it/sec, obj=0.288]
WARNING - 10:51:45: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
WARNING - 10:51:45: The solution is not feasible.
INFO - 10:51:45: Objective: 0.28811314244670916
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = 0.15144075010172386
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.252370379421043 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.032658) ***
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 24.56 it/sec, obj=0.288]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -0.8333333333333334 | 1.5 | float |
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 979.52 it/sec, obj=1.25]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 476.76 it/sec, obj=-.875]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 535.15 it/sec, obj=1.01]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 495.91 it/sec, obj=-.875]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 521.11 it/sec, obj=0.819]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 498.36 it/sec, obj=-.875]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 515.39 it/sec, obj=0.693]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 498.94 it/sec, obj=-.875]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 512.36 it/sec, obj=0.584]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 499.27 it/sec, obj=-.875]
WARNING - 10:51:45: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
WARNING - 10:51:45: The solution is not feasible.
INFO - 10:51:45: Objective: 0.5837798748832244
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = 0.19806414473664136
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.165017254128868 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.031416) ***
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 26.14 it/sec, obj=0.584]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -0.5 | 1.5 | float |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1013.61 it/sec, obj=1.38]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 470.79 it/sec, obj=2.88]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 535.37 it/sec, obj=1.23]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 491.52 it/sec, obj=2.87]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 518.84 it/sec, obj=0.848]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 486.94 it/sec, obj=0.658]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 458.95 it/sec, obj=0.643]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 443.12 it/sec, obj=0.616]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 430.53 it/sec, obj=0.615]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 421.01 it/sec, obj=0.615]
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 13
INFO - 10:51:45: Solution:
INFO - 10:51:45: The solution is feasible.
INFO - 10:51:45: Objective: 0.6150998219543254
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = -0.788285881879476
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.5773788419679762 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.036679) ***
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 26.20 it/sec, obj=0.615]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -0.1666666666666667 | 1.5 | float |
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1001.98 it/sec, obj=1.16]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 479.68 it/sec, obj=2.87]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 535.99 it/sec, obj=0.785]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 477.56 it/sec, obj=2.88]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 485.61 it/sec, obj=0.644]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 457.35 it/sec, obj=0.624]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 434.31 it/sec, obj=0.615]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 421.94 it/sec, obj=0.615]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 412.61 it/sec, obj=0.615]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 406.62 it/sec, obj=0.615]
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
INFO - 10:51:45: The solution is feasible.
INFO - 10:51:45: Objective: 0.6150998205402495
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = -0.7883188793606977
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.5773502675245377 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.036937) ***
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 26.21 it/sec, obj=0.615]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.1666666666666667 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1026.00 it/sec, obj=0.838]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 480.42 it/sec, obj=2.88]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 543.84 it/sec, obj=0.656]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 478.05 it/sec, obj=0.639]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 444.12 it/sec, obj=0.616]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 424.50 it/sec, obj=0.615]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 412.60 it/sec, obj=0.615]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 404.27 it/sec, obj=0.615]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 398.72 it/sec, obj=0.615]
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Successive iterates of the objective function are closer than ftol_rel or ftol_abs. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 10
INFO - 10:51:45: Solution:
INFO - 10:51:45: The solution is feasible.
INFO - 10:51:45: Objective: 0.6150998205402508
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = -0.7883189092934597
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.5773502416020033 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.033393) ***
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 26.53 it/sec, obj=0.615]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.5 | 1.5 | float |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1026.51 it/sec, obj=0.625]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 478.99 it/sec, obj=2.87]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 541.15 it/sec, obj=0.616]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 475.33 it/sec, obj=0.615]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 442.79 it/sec, obj=0.615]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 426.29 it/sec, obj=0.615]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 413.43 it/sec, obj=0.615]
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Successive iterates of the objective function are closer than ftol_rel or ftol_abs. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 8
INFO - 10:51:45: Solution:
INFO - 10:51:45: The solution is feasible.
INFO - 10:51:45: Objective: 0.6150998205402526
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = -0.7883188285028959
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.5773503115686811 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.027915) ***
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 27.34 it/sec, obj=0.615]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.8333333333333335 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1027.51 it/sec, obj=0.745]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 476.84 it/sec, obj=-.875]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 455.52 it/sec, obj=-.267]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 474.94 it/sec, obj=-.809]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 501.65 it/sec, obj=-.868]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 523.29 it/sec, obj=-.874]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 500.95 it/sec, obj=-.266]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 487.94 it/sec, obj=0.135]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 476.68 it/sec, obj=0.577]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 491.09 it/sec, obj=0.288]
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
INFO - 10:51:45: The solution is feasible.
INFO - 10:51:45: Objective: 0.7453703703703706
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = -0.2499785665294918
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 0.8333333333333335 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.032465) ***
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 27.55 it/sec, obj=0.745]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+-------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+-------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 1.166666666666667 | 1.5 | float |
INFO - 10:51:45: +------+-------------+-------------------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 1024.50 it/sec, obj=1.42]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 479.16 it/sec, obj=-.875]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 463.82 it/sec, obj=-.267]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 497.37 it/sec, obj=-.809]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 524.79 it/sec, obj=-.868]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 538.57 it/sec, obj=-.874]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 515.54 it/sec, obj=-.266]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 497.77 it/sec, obj=0.135]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 486.66 it/sec, obj=0.577]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 499.03 it/sec, obj=0.288]
WARNING - 10:51:45: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
WARNING - 10:51:45: The solution is not feasible.
INFO - 10:51:45: Objective: 0.28811314244698893
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = 0.1514407501016959
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.252370379420967 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.032527) ***
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 27.76 it/sec, obj=0.288]
INFO - 10:51:45:
INFO - 10:51:45: *** Start MDOScenario execution ***
INFO - 10:51:45: MDOScenario
INFO - 10:51:45: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:51:45: MDO formulation: DisciplinaryOpt
INFO - 10:51:45: Optimization problem:
INFO - 10:51:45: minimize obj(x)
INFO - 10:51:45: with respect to x
INFO - 10:51:45: subject to constraints:
INFO - 10:51:45: cstr(x) <= 0.0
INFO - 10:51:45: over the design space:
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | 1.5 | 1.5 | float |
INFO - 10:51:45: +------+-------------+-------+-------------+-------+
INFO - 10:51:45: Solving optimization problem with algorithm SLSQP:
INFO - 10:51:45: 10%|█ | 1/10 [00:00<00:00, 996.04 it/sec, obj=2.88]
INFO - 10:51:45: 20%|██ | 2/10 [00:00<00:00, 482.16 it/sec, obj=-.875]
INFO - 10:51:45: 30%|███ | 3/10 [00:00<00:00, 461.28 it/sec, obj=-.267]
INFO - 10:51:45: 40%|████ | 4/10 [00:00<00:00, 498.55 it/sec, obj=-.809]
INFO - 10:51:45: 50%|█████ | 5/10 [00:00<00:00, 522.64 it/sec, obj=-.868]
INFO - 10:51:45: 60%|██████ | 6/10 [00:00<00:00, 542.62 it/sec, obj=-.874]
INFO - 10:51:45: 70%|███████ | 7/10 [00:00<00:00, 515.61 it/sec, obj=-.266]
INFO - 10:51:45: 80%|████████ | 8/10 [00:00<00:00, 498.76 it/sec, obj=0.135]
INFO - 10:51:45: 90%|█████████ | 9/10 [00:00<00:00, 486.08 it/sec, obj=0.577]
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 498.51 it/sec, obj=0.288]
WARNING - 10:51:45: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 12
INFO - 10:51:45: Solution:
WARNING - 10:51:45: The solution is not feasible.
INFO - 10:51:45: Objective: 0.28811314244587316
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = 0.15144075010180735
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -1.252370379421268 | 1.5 | float |
INFO - 10:51:45: +------+-------------+--------------------+-------------+-------+
INFO - 10:51:45: *** End MDOScenario execution (time: 0:00:00.033464) ***
INFO - 10:51:45: 100%|██████████| 10/10 [00:00<00:00, 27.87 it/sec, obj=0.288]
INFO - 10:51:45: Optimization result:
INFO - 10:51:45: Optimizer info:
INFO - 10:51:45: Status: None
INFO - 10:51:45: Message: None
INFO - 10:51:45: Number of calls to the objective function by the optimizer: 10
INFO - 10:51:45: Solution:
INFO - 10:51:45: The solution is feasible.
INFO - 10:51:45: Objective: 0.6150998205402495
INFO - 10:51:45: Standardized constraints:
INFO - 10:51:45: cstr = -0.7883188793606977
INFO - 10:51:45: Design space:
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: | x | -1.5 | -0.1666666666666667 | 1.5 | float |
INFO - 10:51:45: +------+-------------+---------------------+-------------+-------+
INFO - 10:51:45: *** End DOEScenario execution (time: 0:00:00.372043) ***
{'eval_jac': False, 'n_samples': 10, 'algo': 'fullfact'}
Plot the optimum objective for different x0¶
scenario_doe.post_process("BasicHistory", variable_names=["obj"], save=False, show=True)
<gemseo.post.basic_history.BasicHistory object at 0x7f1de1e97130>
Total running time of the script: (0 minutes 0.577 seconds)