---
title: Spiral optimization algorithm
slug: spiral-optimization-algorithm
qid: 
snapshot: enwiki-001318674210
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1318674210
tags: [20349224, 23603337, 23617828, 24998945, 26220375, 29176634, 72784985]
---

# Spiral optimization algorithm

> [!note] Provenance
> Snapshot `enwiki-001318674210` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1318674210> · Licensed CC BY-SA 4.0

In mathematics, the spiral optimization (SPO) algorithm is a metaheuristic inspired by spiral phenomena in nature. The first SPO algorithm was proposed for two-dimensional unconstrained optimization based on two-dimensional spiral models. This was extended to n-dimensional problems by generalizing the two-dimensional spiral model to an n-dimensional spiral model. There are effective settings for the SPO algorithm: the periodic descent direction setting and the convergence setting.

In mathematics, the spiral optimization (SPO) algorithm is a metaheuristic inspired by spiral phenomena in nature. The first SPO algorithm was proposed for two-dimensional unconstrained optimization based on two-dimensional spiral models. This was extended to n-dimensional problems by generalizing the two-dimensional spiral model to an n-dimensional spiral model. There are effective settings for the SPO algorithm: the periodic descent direction setting and the convergence setting. 1) Place the initial search points x_i (0) \in \mathbb{R}^n~(i=1, \ldots, m) and determine the center x^{\star}(0)= x_{i_\text{b} }(0) , \displaystyle i_\text{b} =\mathop{\text{argmin}}_{i=1,\ldots,m} \{ f(x_{i}(0)) \} , and then set k = 0 . 2) Decide the step rate r(k) by a rule. 3) Update the search points: x_i(k+1) = x^{\star}(k) + r(k) R(\theta) (x_i(k) - x^{\star}(k))\quad(i=1, \ldots, m). 4) Update the center: x^{\star}(k+1) = \begin{cases} x_{i_\text{b}}(k+1) & \big( \text{if } f(x_{i_\text{b}}(k+1)) where \displaystyle i_\text{b} = \mathop{\text{argmin}}_{i=1,\ldots,m} \{ f(x_i (k+1)) \} . 5) Set k := k+1 . If k=k_{\max} is satisfied then terminate and output x^{\star}(k) . Otherwise, return to Step 2). The search performance depends on setting the composite rotation matrix R(\theta) , the step rate r(k) , and the initial points x_i(0)~(i=1,\ldots,m) . The following settings are new and effective. This setting is an effective setting for high dimensional problems under the maximum iteration k_{\max} . The conditions on R(\theta) and x_i(0)~(i=1,\ldots,m) together ensure that the spiral models generate descent directions periodically. The condition of r(k) works to utilize the periodic descent directions under the search termination k_{\max} . Set R(\theta) as follows: R(\theta) = \begin{bmatrix} 0_{n-1}^\top &-1\\ I_{n-1}& 0_{n-1}\\ \end{bmatrix} where I_{n-1} is the (n-1)\times (n-1) identity matrix and 0_{n-1} is the (n-1)\times 1 zero vector. Place the initial points x_i(0) \in \mathbb{R}^n (i = 1,\ldots, m) at random to satisfy the following condition: \min_{i=1,\ldots,m} \{ \max_{j=1,\ldots,m} \bigl \{ \text{rank} \bigl[ d_{j,i}(0)~R(\theta)d_{j,i}(0)~~ \cdots~~R(\theta)^{2n-1}d_{j,i}(0) \bigr]\bigr\} \bigr\} = n where d_{j,i}(0) = x_{j}(0) - x_i(0) . Note that this condition is almost all satisfied by a random placing and thus no check is actually fine. Set r(k) at Step 2) as follows: r(k) = r = \sqrt[ k_{\max} ]{\delta }~~~~\text{(constant value)} where a sufficiently small \delta > 0 such as \delta = 1/k_{\max} or \delta = 10^{-3} . This setting ensures that the SPO algorithm converges to a stationary point under the maximum iteration k_{\max} = \infty . The settings of R(\theta) and the initial points x_i(0)~(i=1,\ldots,m) are the same with the above Setting 1. The setting of r(k) is as follows. Set r(k) at Step 2) as follows: r(k) = \begin{cases} 1 & (k^\star \leqq k \leqq k^\star + 2n-1), \\ h & (k \geqq k^\star + 2n), \end{cases} where k^\star is an iteration when the center is newly updated at Step 4) and h = \sqrt[ 2n ]{\delta }, \delta \in (0,1) such as \delta = 0.5 . Thus we have to add the following rules about k^\star to the Algorithm: •(Step 1) k^\star = 0 . •(Step 4) If x^{\star}(k+1)\neq x^{\star}(k) then k^\star = k+1 .
