<s>
For	O
mathematical	O
optimization	O
,	O
Multilevel	O
Coordinate	O
Search	O
(	O
MCS	O
)	O
is	O
an	O
efficient	O
algorithm	O
for	O
bound	O
constrained	O
global	O
optimization	O
using	O
function	O
values	O
only	B-Algorithm
.	O
</s>
<s>
Additionally	O
,	O
a	O
local	O
search	O
combining	O
a	O
(	O
multi-dimensional	O
)	O
quadratic	O
interpolant	O
of	O
the	O
function	O
and	O
line	B-Algorithm
searches	I-Algorithm
can	O
be	O
used	O
to	O
augment	O
performance	O
of	O
the	O
algorithm	O
(	O
MCS	O
with	O
local	O
search	O
)	O
;	O
in	O
this	O
case	O
the	O
plain	O
MCS	O
is	O
used	O
to	O
provide	O
the	O
starting	O
(	O
initial	O
)	O
points	O
.	O
</s>
<s>
In	O
this	O
case	O
the	O
splitting	O
point	O
is	O
defined	O
as	O
the	O
minimum	O
of	O
the	O
surrogate	O
along	O
a	O
line	O
segment	O
and	O
the	O
box	O
is	O
split	O
only	B-Algorithm
if	O
the	O
interpolant	O
value	O
(	O
serving	O
as	O
a	O
proxy	O
for	O
the	O
true	O
value	O
of	O
the	O
objective	O
)	O
is	O
lower	O
than	O
the	O
current	O
best	O
sampled	O
function	O
value	O
.	O
</s>
<s>
MCS	O
is	O
designed	O
to	O
be	O
implemented	O
in	O
an	O
efficient	O
recursive	O
manner	O
with	O
the	O
aid	O
of	O
trees	B-Application
.	O
</s>
