Using Objective Clustering for Solving Many-Objective Optimization Problems

Table 3

Complexity of the compared objective reduction algorithms.

Algorithm	Complexity
Deb and Saxena
(1) PCA based reduction	𝑂(𝑛𝑚^2+𝑚^3)
(2) NL-MVU-PCA based reduction	𝑂(𝑚^3𝑞^3),  where   𝑞  is  the  neighborhood  size
	In  the  most  constrained  case,   𝑞=𝑂(𝑚)
𝛿−MOSS
(1) Exact Algorithm	𝑂(𝑛^2𝑚2^𝑚)
(2) Greedy Algorithm	𝑂(min{𝑛^2𝑚^3,𝑛^4𝑚^2})
OC-ORA	𝑂(𝑣^2𝑚^2)