Vortex point searching algorithm based on nearest neighbors point

To realize the preprocessing of the initial points or called vortex points before optimization iterations and to ensure that different local optimums can be achieved,which makes global optimum obtained easily by comparison of these local optimums,a vortex point searching algorithm is proposed,in which Pan-distance based on nearest neighbors searching algorithm is adopted.The criterion is that there must be a peak between two vortex points.Pan-distance is regard as characteristic parameter of describing the similarity between multi-dimensional data in the algorithm.The nearest neighbors searching algorithm for high-dimensional space based on Pan-distance reduces the calculation burden of vortex point searching effectively.The numerical results show that when the density of scatter points is sufficient,vortex points in high-dimensional space is searched quickly and efficiently by using this algorithm.