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:53:50:
INFO - 10:53:50: *** Start DOEScenario execution ***
INFO - 10:53:50: DOEScenario
INFO - 10:53:50: Disciplines: MDOScenario_adapter
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 1.5 | 1.5 | float |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm fullfact:
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.5 | 1.5 | float |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 130.10 it/sec, obj=-.875]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 164.89 it/sec, obj=-.267]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 220.34 it/sec, obj=-.809]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 262.46 it/sec, obj=-.868]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 298.45 it/sec, obj=-.872]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 309.74 it/sec, obj=-.265]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 319.47 it/sec, obj=0.136]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 326.97 it/sec, obj=0.579]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 346.16 it/sec, obj=0.289]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 350.48 it/sec, obj=1.25]
WARNING - 10:53:50: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
WARNING - 10:53:50: The solution is not feasible.
INFO - 10:53:50: Objective: 0.2888129873625884
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = 0.1513713660745195
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.252181466244097 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.041701) ***
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 20.86 it/sec, obj=0.289]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.166666666666667 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 912.00 it/sec, obj=0.579]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 415.79 it/sec, obj=-.875]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 410.47 it/sec, obj=-.267]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 452.55 it/sec, obj=-.809]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 482.54 it/sec, obj=-.868]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 504.66 it/sec, obj=-.874]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 486.01 it/sec, obj=-.266]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 472.15 it/sec, obj=0.135]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 460.92 it/sec, obj=0.577]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 475.20 it/sec, obj=0.288]
WARNING - 10:53:50: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
WARNING - 10:53:50: The solution is not feasible.
INFO - 10:53:50: Objective: 0.28811314244670916
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = 0.15144075010172386
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.252370379421043 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.033168) ***
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 24.29 it/sec, obj=0.288]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -0.8333333333333334 | 1.5 | float |
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 893.93 it/sec, obj=1.25]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 435.77 it/sec, obj=-.875]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 500.81 it/sec, obj=1.01]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 466.34 it/sec, obj=-.875]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 495.58 it/sec, obj=0.819]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 474.91 it/sec, obj=-.875]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 494.69 it/sec, obj=0.693]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 478.62 it/sec, obj=-.875]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 494.02 it/sec, obj=0.584]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 482.07 it/sec, obj=-.875]
WARNING - 10:53:50: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
WARNING - 10:53:50: The solution is not feasible.
INFO - 10:53:50: Objective: 0.5837798748832244
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = 0.19806414473664136
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.165017254128868 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.031772) ***
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 25.86 it/sec, obj=0.584]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -0.5 | 1.5 | float |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 912.60 it/sec, obj=1.38]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 433.50 it/sec, obj=2.88]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 497.07 it/sec, obj=1.23]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 465.06 it/sec, obj=2.87]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 492.45 it/sec, obj=0.848]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 463.25 it/sec, obj=0.658]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 429.21 it/sec, obj=0.643]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 414.74 it/sec, obj=0.616]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 405.93 it/sec, obj=0.615]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 399.31 it/sec, obj=0.615]
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 13
INFO - 10:53:50: Solution:
INFO - 10:53:50: The solution is feasible.
INFO - 10:53:50: Objective: 0.6150998219543254
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = -0.788285881879476
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.5773788419679762 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.037247) ***
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 25.91 it/sec, obj=0.615]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -0.1666666666666667 | 1.5 | float |
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 957.60 it/sec, obj=1.16]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 453.34 it/sec, obj=2.87]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 517.96 it/sec, obj=0.785]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 460.82 it/sec, obj=2.88]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 472.82 it/sec, obj=0.644]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 436.00 it/sec, obj=0.624]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 415.34 it/sec, obj=0.615]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 405.44 it/sec, obj=0.615]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 398.15 it/sec, obj=0.615]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 392.47 it/sec, obj=0.615]
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
INFO - 10:53:50: The solution is feasible.
INFO - 10:53:50: Objective: 0.6150998205402495
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = -0.7883188793606977
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.5773502675245377 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.037450) ***
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 25.91 it/sec, obj=0.615]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.1666666666666667 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 959.58 it/sec, obj=0.838]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 452.12 it/sec, obj=2.88]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 515.33 it/sec, obj=0.656]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 460.02 it/sec, obj=0.639]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 430.79 it/sec, obj=0.616]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 403.69 it/sec, obj=0.615]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 395.50 it/sec, obj=0.615]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 389.60 it/sec, obj=0.615]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 384.40 it/sec, obj=0.615]
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Successive iterates of the objective function are closer than ftol_rel or ftol_abs. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 10
INFO - 10:53:50: Solution:
INFO - 10:53:50: The solution is feasible.
INFO - 10:53:50: Objective: 0.6150998205402508
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = -0.7883189092934597
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.5773502416020033 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.033640) ***
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 26.26 it/sec, obj=0.615]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.5 | 1.5 | float |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 946.37 it/sec, obj=0.625]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 444.43 it/sec, obj=2.87]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 504.41 it/sec, obj=0.616]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 453.52 it/sec, obj=0.615]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 425.96 it/sec, obj=0.615]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 410.19 it/sec, obj=0.615]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 400.94 it/sec, obj=0.615]
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Successive iterates of the objective function are closer than ftol_rel or ftol_abs. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 8
INFO - 10:53:50: Solution:
INFO - 10:53:50: The solution is feasible.
INFO - 10:53:50: Objective: 0.6150998205402526
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = -0.7883188285028959
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.5773503115686811 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.028203) ***
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 27.08 it/sec, obj=0.615]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.8333333333333335 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 914.79 it/sec, obj=0.745]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 436.79 it/sec, obj=-.875]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 430.85 it/sec, obj=-.267]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 448.53 it/sec, obj=-.809]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 477.98 it/sec, obj=-.868]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 501.03 it/sec, obj=-.874]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 483.08 it/sec, obj=-.266]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 470.07 it/sec, obj=0.135]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 461.96 it/sec, obj=0.577]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 475.94 it/sec, obj=0.288]
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
INFO - 10:53:50: The solution is feasible.
INFO - 10:53:50: Objective: 0.7453703703703706
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = -0.2499785665294918
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 0.8333333333333335 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.032753) ***
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 27.30 it/sec, obj=0.745]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+-------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+-------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 1.166666666666667 | 1.5 | float |
INFO - 10:53:50: +------+-------------+-------------------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 920.21 it/sec, obj=1.42]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 439.79 it/sec, obj=-.875]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 428.12 it/sec, obj=-.267]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 469.29 it/sec, obj=-.809]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 496.64 it/sec, obj=-.868]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 518.79 it/sec, obj=-.874]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 495.47 it/sec, obj=-.266]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 481.66 it/sec, obj=0.135]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 470.15 it/sec, obj=0.577]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 484.31 it/sec, obj=0.288]
WARNING - 10:53:50: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
WARNING - 10:53:50: The solution is not feasible.
INFO - 10:53:50: Objective: 0.28811314244698893
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = 0.1514407501016959
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.252370379420967 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.032686) ***
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 27.53 it/sec, obj=0.288]
INFO - 10:53:50:
INFO - 10:53:50: *** Start MDOScenario execution ***
INFO - 10:53:50: MDOScenario
INFO - 10:53:50: Disciplines: AnalyticDiscipline AnalyticDiscipline
INFO - 10:53:50: MDO formulation: DisciplinaryOpt
INFO - 10:53:50: Optimization problem:
INFO - 10:53:50: minimize obj(x)
INFO - 10:53:50: with respect to x
INFO - 10:53:50: subject to constraints:
INFO - 10:53:50: cstr(x) <= 0.0
INFO - 10:53:50: over the design space:
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | 1.5 | 1.5 | float |
INFO - 10:53:50: +------+-------------+-------+-------------+-------+
INFO - 10:53:50: Solving optimization problem with algorithm SLSQP:
INFO - 10:53:50: 10%|█ | 1/10 [00:00<00:00, 940.64 it/sec, obj=2.88]
INFO - 10:53:50: 20%|██ | 2/10 [00:00<00:00, 443.94 it/sec, obj=-.875]
INFO - 10:53:50: 30%|███ | 3/10 [00:00<00:00, 431.23 it/sec, obj=-.267]
INFO - 10:53:50: 40%|████ | 4/10 [00:00<00:00, 472.11 it/sec, obj=-.809]
INFO - 10:53:50: 50%|█████ | 5/10 [00:00<00:00, 500.39 it/sec, obj=-.868]
INFO - 10:53:50: 60%|██████ | 6/10 [00:00<00:00, 520.46 it/sec, obj=-.874]
INFO - 10:53:50: 70%|███████ | 7/10 [00:00<00:00, 498.62 it/sec, obj=-.266]
INFO - 10:53:50: 80%|████████ | 8/10 [00:00<00:00, 474.08 it/sec, obj=0.135]
INFO - 10:53:50: 90%|█████████ | 9/10 [00:00<00:00, 463.10 it/sec, obj=0.577]
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 470.71 it/sec, obj=0.288]
WARNING - 10:53:50: Optimization found no feasible point ! The least infeasible point is selected.
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: Maximum number of iterations reached. GEMSEO Stopped the driver
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 12
INFO - 10:53:50: Solution:
WARNING - 10:53:50: The solution is not feasible.
INFO - 10:53:50: Objective: 0.28811314244587316
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = 0.15144075010180735
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -1.252370379421268 | 1.5 | float |
INFO - 10:53:50: +------+-------------+--------------------+-------------+-------+
INFO - 10:53:50: *** End MDOScenario execution (time: 0:00:00.034685) ***
INFO - 10:53:50: 100%|██████████| 10/10 [00:00<00:00, 27.57 it/sec, obj=0.288]
INFO - 10:53:50: Optimization result:
INFO - 10:53:50: Optimizer info:
INFO - 10:53:50: Status: None
INFO - 10:53:50: Message: None
INFO - 10:53:50: Number of calls to the objective function by the optimizer: 10
INFO - 10:53:50: Solution:
INFO - 10:53:50: The solution is feasible.
INFO - 10:53:50: Objective: 0.6150998205402495
INFO - 10:53:50: Standardized constraints:
INFO - 10:53:50: cstr = -0.7883188793606977
INFO - 10:53:50: Design space:
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: | Name | Lower bound | Value | Upper bound | Type |
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: | x | -1.5 | -0.1666666666666667 | 1.5 | float |
INFO - 10:53:50: +------+-------------+---------------------+-------------+-------+
INFO - 10:53:50: *** End DOEScenario execution (time: 0:00:00.375367) ***
{'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 0x7efd3472cd60>
Total running time of the script: (0 minutes 0.576 seconds)