<s>
Adaptive	B-Algorithm
coordinate	I-Algorithm
descent	I-Algorithm
is	O
an	O
improvement	O
of	O
the	O
coordinate	B-Algorithm
descent	I-Algorithm
algorithm	O
to	O
non-separable	O
optimization	O
by	O
the	O
use	O
of	O
adaptive	O
encoding	O
.	O
</s>
<s>
The	O
adaptive	B-Algorithm
coordinate	I-Algorithm
descent	I-Algorithm
approach	O
gradually	O
builds	O
a	O
transformation	O
of	O
the	O
coordinate	O
system	O
such	O
that	O
the	O
new	O
coordinates	O
are	O
as	O
decorrelated	O
as	O
possible	O
with	O
respect	O
to	O
the	O
objective	O
function	O
.	O
</s>
<s>
The	O
adaptive	B-Algorithm
coordinate	I-Algorithm
descent	I-Algorithm
was	O
shown	O
to	O
be	O
competitive	O
to	O
the	O
state-of-the-art	O
evolutionary	B-Algorithm
algorithms	I-Algorithm
and	O
has	O
the	O
following	O
invariance	O
properties	O
:	O
</s>
<s>
CMA-like	O
Adaptive	O
Encoding	O
Update	O
(	O
b	O
)	O
mostly	O
based	O
on	O
principal	B-Application
component	I-Application
analysis	I-Application
(	O
a	O
)	O
is	O
used	O
to	O
extend	O
the	O
coordinate	B-Algorithm
descent	I-Algorithm
method	O
(	O
c	O
)	O
to	O
the	O
optimization	O
of	O
non-separable	O
problems	O
(	O
d	O
)	O
.	O
</s>
<s>
The	O
adaptation	O
of	O
an	O
appropriate	O
coordinate	O
system	O
allows	O
adaptive	B-Algorithm
coordinate	I-Algorithm
descent	I-Algorithm
to	O
outperform	O
coordinate	B-Algorithm
descent	I-Algorithm
on	O
non-separable	O
functions	O
.	O
</s>
<s>
The	O
adaptive	B-Algorithm
coordinate	I-Algorithm
descent	I-Algorithm
method	O
reaches	O
the	O
target	O
value	O
after	O
only	O
325	O
function	O
evaluations	O
(	O
about	O
70	O
times	O
faster	O
than	O
coordinate	B-Algorithm
descent	I-Algorithm
)	O
,	O
that	O
is	O
comparable	O
to	O
gradient-based	B-Algorithm
methods	I-Algorithm
.	O
</s>
<s>
First	O
approaches	O
to	O
optimization	O
using	O
adaptive	O
coordinate	O
system	O
were	O
proposed	O
already	O
in	O
the	O
1960s	O
(	O
see	O
,	O
e.g.	O
,	O
Rosenbrock	B-Algorithm
's	I-Algorithm
method	I-Algorithm
)	O
.	O
</s>
