A straightforward local-search optimization algorithm on the symmetric group
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.