<s>
In	O
mathematics	O
,	O
the	O
spiral	O
optimization	O
(	O
SPO	O
)	O
algorithm	O
is	O
a	O
metaheuristic	B-Algorithm
inspired	O
by	O
spiral	O
phenomena	O
in	O
nature	O
.	O
</s>
<s>
The	O
SPO	O
algorithm	O
is	O
a	O
multipoint	B-Application
search	I-Application
algorithm	I-Application
that	O
has	O
no	O
objective	O
function	O
gradient	O
,	O
which	O
uses	O
multiple	O
spiral	O
models	O
that	O
can	O
be	O
described	O
as	O
deterministic	O
dynamical	O
systems	O
.	O
</s>
<s>
The	O
general	O
SPO	O
algorithm	O
for	O
a	O
minimization	O
problem	O
under	O
the	O
maximum	O
iteration	B-Algorithm
(	O
termination	O
criterion	O
)	O
is	O
as	O
follows	O
:	O
</s>
<s>
0	O
)	O
Set	O
the	O
number	O
of	O
search	O
points	O
and	O
the	O
maximum	O
iteration	B-Algorithm
number	O
.	O
</s>
<s>
The	O
search	O
performance	O
depends	O
on	O
setting	O
the	O
composite	O
rotation	B-Algorithm
matrix	I-Algorithm
,	O
the	O
step	O
rate	O
,	O
and	O
the	O
initial	O
points	O
.	O
</s>
<s>
This	O
setting	O
is	O
an	O
effective	O
setting	O
for	O
high	O
dimensional	O
problems	O
under	O
the	O
maximum	O
iteration	B-Algorithm
.	O
</s>
<s>
This	O
setting	O
ensures	O
that	O
the	O
SPO	O
algorithm	O
converges	O
to	O
a	O
stationary	O
point	O
under	O
the	O
maximum	O
iteration	B-Algorithm
.	O
</s>
<s>
Set	O
at	O
Step	O
2	O
)	O
as	O
follows	O
:	O
where	O
is	O
an	O
iteration	B-Algorithm
when	O
the	O
center	O
is	O
newly	O
updated	O
at	O
Step	O
4	O
)	O
and	O
such	O
as	O
.	O
</s>
