An Extension of the Nested Partitions Method
EBERT BREA
Algorithm. The
Initialization
Given:
the
minimize
z∈Rn×Zm
f(z),
l
|
{z
}
n
;
|
{z
}
m
)t
|
{z
}
n
;
|
{z
}
m
)t;
the
Choose:
an
|
{z
}
n
;
|
{z
}
m
)t
Declare:
the
|
{z
}
n
;
|
{z
}
m
)t;
Let k
Calculate:
the
while ε
Partitioning
Partition
j=1
Aggregate
S(σ(k));
Random Sampling Execute
j=1
,
namely:
s=1
Execute
(k)
;
Measuring
Calculate
j,s
for
region
σMσ(k)+1 (k);
Estimating
Estimate
I(σˆ
s∈{1,...,Nj
and
ˆjk
min
j∈{1,...,Mσ(k)+1}
I(σˆ
In
if ˆjk
Let σ(k
jk
Update by
else
Backtrack
Figure 8.
Revista
Semestre
ISSN
ISSN:
124