Outputs#
A run returns its results in memory (RunResult) and writes them to its output folder,
<working_dir>/<mdo_name>_post.
Result objects#
RunResult (session.result()):
Field |
Meaning |
|---|---|
|
|
|
Why the run ended ( |
|
Number of completed outer iterations. |
|
Objective of the master subproblem at the last design. |
|
Largest scaled inconsistency between linked copies, \(\|\mathbf{q}\|_\infty\). |
|
Whether the master subproblem satisfies its constraints (violation \(\le 10^{-12}\)). |
|
Every variable copy, keyed |
|
One |
|
The output folder. |
RunResult.to_dict() returns the same content as JSON-ready values.
IterationRecord (session.step(), observers): iteration, objective,
max_inconsistency, max_penalty_weight, variables_change (Euclidean norm of the change of all copies) and
worst_link (index of the link with the largest inconsistency).
All the .out files are comma-separated tables; the post-processing dashboard (The post-processing dashboard)
plots any of their columns interactively.
The output folder#
<mdo_name>_post/
├── Coordination_history.out
├── DMDO.log
├── coord_chk.pkl
└── coordination_summary_post/
├── SP_1/
│ ├── SP_1_0.out, SP_1_1.out, ...
│ └── OMADS.log
└── SP_2/ ...
Coordination_history.outOne row per outer iteration (comma-separated, columns padded with spaces). Load it with
pandas.read_csv(path, skipinitialspace=True)and strip the column names.DMDO.logThe log of the run: problem setup, the progress lines, stopping messages.
coord_chk.pklCheckpoint written at the start of every outer iteration after the first; resume with
Session.from_checkpoint(The Session API).SP_<j>/SP_<j>_<t>.outEvery evaluation of subproblem \(j\) during outer iteration \(t\).
SP_<j>/OMADS.logLog of the OMADS solver of subproblem \(j\).
Coordination_history.out#
Column |
Meaning |
|---|---|
|
Wall-clock time at the end of the outer iteration. |
|
Outer iteration. |
|
\(\|\mathbf{q}\|_\infty\) after the inner loop. |
columns 4 and 5 |
Reserved flags (0). |
|
Objective of the master subproblem. |
|
|
|
Euclidean norm of the change of all copies during the iteration. |
|
Largest penalty weight. |
|
The link with the largest inconsistency, as |
|
Constraint violation of subproblem \(j\). |
|
Value of every variable copy. |
SP_<j>_<t>.out#
One row per evaluation of the subproblem: Time, Iteration #, Evaluation #, Max. inconsistency,
Penalty (\(\phi\)), Objective (the local objective without the penalty), Coupling Status (feasibility
of the local constraints), followed by the design variables and the responses of the subproblem.