![]() |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
Outcome of a simplex minimization. More...
#include <line/util/neldermead.h>
Public Attributes | |
| std::vector< T > | x |
| best point found | |
| T | fval |
| objective there | |
| unsigned | iterations |
| simplex iterations performed | |
| unsigned | evaluations |
| objective evaluations | |
| bool | converged |
| both tolerances met before the caps | |
Outcome of a simplex minimization.
Definition at line 96 of file neldermead.h.
| bool line::NelderMeadResult< T >::converged |
both tolerances met before the caps
Definition at line 101 of file neldermead.h.
Referenced by line::auglag(), line::nelder_mead(), and line::nelder_mead_box().
| unsigned line::NelderMeadResult< T >::evaluations |
objective evaluations
Definition at line 100 of file neldermead.h.
Referenced by line::nelder_mead(), and line::nelder_mead_box().
| T line::NelderMeadResult< T >::fval |
objective there
Definition at line 98 of file neldermead.h.
Referenced by line::mam::amap2_adjust_gamma(), line::nelder_mead(), and line::nelder_mead_box().
| unsigned line::NelderMeadResult< T >::iterations |
simplex iterations performed
Definition at line 99 of file neldermead.h.
Referenced by line::nelder_mead(), and line::nelder_mead_box().
| std::vector<T> line::NelderMeadResult< T >::x |
best point found
Definition at line 97 of file neldermead.h.
Referenced by line::mam::amap2_adjust_gamma(), line::auglag(), line::api::infer_mlps(), line::nelder_mead(), and line::nelder_mead_box().