对称群上的直接局部搜索optimization算法
A straightforward local-search optimization algorithm on the symmetric group
摘要：
给定定义在对称群上的实目标函数，提出了一种直接局部搜索算法，并估计了其复杂度。特别是对于一个$n$维单位向量，我们感兴趣的置换等距，这个向量上的映射到一个给定的角度的圆锥。
英文摘要：
Given a real objective function defined over the symmetric group, a direct local-search algorithm is proposed, and its complexity is estimated. In particular for an $n$-dimensional unit vector we are interested in the permutation isometry that acts on this vector by mapping it into a cone of a given angle.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
