Description Usage Arguments Details Value See Also
Helper for cobraPhaseII: The new iterate xNew, which was found by optimization
on the surrogate models, is evaluated on the real function cobra$fn. In the case of equality
constraints, evalReal does the additional refine step (see Details).
1 2 3 4 5 6 7 8 9 10 11 | evalReal(
cobra,
ev1,
xNew,
fValue,
feval,
optimConv,
optimTime,
currentEps,
fitnessSurrogate = cobra$fitnessSurrogate
)
|
cobra |
an object of class COBRA, this is a (long) list containing all settings
from |
ev1 |
a list, initially empty, gradually filled by calls to |
xNew |
the new point, see |
fValue |
fitness value estimated for |
feval |
function evaluations on surrogates needed by COBRA optimizer |
optimConv |
see |
optimTime |
see |
currentEps |
artificial current margin for the equality constraints: A point is said to be artificially feasible, if h_j(x) - currentEps ≤ 0, -h_j(x) - currentEps ≤ 0, for all equality constraints and if it is feasible in the inequality constraints. |
fitnessSurrogate |
[ |
If cobra$equHandle$active==TRUE, then xNew is first refined: The artificially feasible
solution xNew is replaced by a refined solution ev1$xNew.
ev1$xNew is created by using optim to minimize the function
∑_i{\max(0,g_i(x))} + ∑_j{h_j^2(x) }
Ideally, the refined solution ev1$xNew should be on the equality constraints
(within machine accuracy), but there is no guarantee that optim reaches this desired result.
ev1, a list with the following n-dim vectors ( n = number of
iterations, the last element is from the new iterate / point xNew ):
|
prediction of |
|
|
|
function evaluations on surrogates needed by COBRA optimizer |
|
see |
|
see |
|
prediction of |
|
TRUE, if |
|
TRUE, if |
In addition, ev1 has these elements:
|
|
|
|
|
scalar, the number of constraint violations (above
|
|
scalar, the number of constraint violations (above
|
|
scalar, the maximum constraint violation (with
|
|
scalar, the maximum constraint violation (w/o
|
If cobra$equHandle$active==TRUE, then the last four values are for xNew after
the refine step. In this case, the first three elements newNumViol, newNumPred,
and newMaxViol refer to the artificially enlarged equality constraints, i.e.
h_j(x) - currentEps ≤ 0, -h_j(x) - currentEps ≤ 0,
and the true inequality constraints max(0,g_i(x)). The last element trueMaxViol
measures the maximum violation among the true equality constraints |h_j(x)| and the
true inequality constraints max(0,g_i(x)).
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.